Re: [sage-support] Cyclic Codes

2023-07-11 Thread David Joyner
On Tue, Jul 11, 2023 at 1:46 PM GUSTAVO TERRA BASTOS 
wrote:

> Firstly I define the finite extension field and the generator polynomial.
> Then, when I try to define/describe the cyclic code using *" Cc =
> codes.CyclicCode(generator_pol = g, length =n)"  *I got the following
> message: *'sage.rings.finite_rings.element_givaro.FiniteField_givaroElement'
> object has no attribute 'degree'. *
>
>
There are examples of how to use the syntax here:
https://doc.sagemath.org/html/en/reference/coding/sage/coding/cyclic_code.html


Best
>
> Em terça-feira, 11 de julho de 2023 às 05:13:49 UTC-3, David Joyner
> escreveu:
>
>> On Tue, Jul 11, 2023 at 4:10 AM GUSTAVO TERRA BASTOS 
>> wrote:
>>
>>> Hi !
>>>
>>> I have been facing problems to describe cyclic codes over finite
>>> extension fields. It is easy to do with GF(p), but I can´t explicit codes
>>> over GF(p^m) (noticing all the mathematical background). Anyone could
>>> provide me an example?
>>>
>>>
>> I'm not sure what you mean by "describe" but the tutorial might help:
>> https://doc.sagemath.org/html/en/thematic_tutorials/coding_theory.html
>>
>>
>>> Best,
>>>
>>> --
>>> You received this message because you are subscribed to the Google
>>> Groups "sage-support" group.
>>> To unsubscribe from this group and stop receiving emails from it, send
>>> an email to sage-support...@googlegroups.com.
>>> To view this discussion on the web visit
>>> https://groups.google.com/d/msgid/sage-support/56deffc7-4ce2-4b41-bc68-61d9f1a13240n%40googlegroups.com
>>> 
>>> .
>>>
>> --
> You received this message because you are subscribed to the Google Groups
> "sage-support" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to sage-support+unsubscr...@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/sage-support/def4b40d-0b33-469e-a143-6193c3f16c29n%40googlegroups.com
> 
> .
>

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/sage-support/CAEQuuAU7sx_kt_NiMZzb9jFKwcS_wshkeYWHYxnpz-_WGDi5Fg%40mail.gmail.com.


Re: [sage-support] Cyclic Codes

2023-07-11 Thread GUSTAVO TERRA BASTOS
Firstly I define the finite extension field and the generator polynomial. 
Then, when I try to define/describe the cyclic code using *" Cc = 
codes.CyclicCode(generator_pol = g, length =n)"  *I got the following 
message: *'sage.rings.finite_rings.element_givaro.FiniteField_givaroElement' 
object has no attribute 'degree'. *

Best

Em terça-feira, 11 de julho de 2023 às 05:13:49 UTC-3, David Joyner 
escreveu:

> On Tue, Jul 11, 2023 at 4:10 AM GUSTAVO TERRA BASTOS  
> wrote:
>
>> Hi !
>>
>> I have been facing problems to describe cyclic codes over finite 
>> extension fields. It is easy to do with GF(p), but I can´t explicit codes 
>> over GF(p^m) (noticing all the mathematical background). Anyone could 
>> provide me an example?
>>
>>
> I'm not sure what you mean by "describe" but the tutorial might help:
> https://doc.sagemath.org/html/en/thematic_tutorials/coding_theory.html
>  
>
>> Best,
>>
>> -- 
>> You received this message because you are subscribed to the Google Groups 
>> "sage-support" group.
>> To unsubscribe from this group and stop receiving emails from it, send an 
>> email to sage-support...@googlegroups.com.
>> To view this discussion on the web visit 
>> https://groups.google.com/d/msgid/sage-support/56deffc7-4ce2-4b41-bc68-61d9f1a13240n%40googlegroups.com
>>  
>> 
>> .
>>
>

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/sage-support/def4b40d-0b33-469e-a143-6193c3f16c29n%40googlegroups.com.


Re: [sage-support] Cyclic Codes

2023-07-11 Thread David Joyner
On Tue, Jul 11, 2023 at 4:10 AM GUSTAVO TERRA BASTOS 
wrote:

> Hi !
>
> I have been facing problems to describe cyclic codes over finite extension
> fields. It is easy to do with GF(p), but I can´t explicit codes over
> GF(p^m) (noticing all the mathematical background). Anyone could provide me
> an example?
>
>
I'm not sure what you mean by "describe" but the tutorial might help:
https://doc.sagemath.org/html/en/thematic_tutorials/coding_theory.html


> Best,
>
> --
> You received this message because you are subscribed to the Google Groups
> "sage-support" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to sage-support+unsubscr...@googlegroups.com.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/sage-support/56deffc7-4ce2-4b41-bc68-61d9f1a13240n%40googlegroups.com
> 
> .
>

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/sage-support/CAEQuuAWcDhyDEg7pD7ysZAawkdR91G57cX4o44fnXnPkUCop5g%40mail.gmail.com.


[sage-support] Cyclic Codes

2023-07-11 Thread GUSTAVO TERRA BASTOS
Hi !

I have been facing problems to describe cyclic codes over finite extension 
fields. It is easy to do with GF(p), but I can´t explicit codes over 
GF(p^m) (noticing all the mathematical background). Anyone could provide me 
an example?

Best,

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/sage-support/56deffc7-4ce2-4b41-bc68-61d9f1a13240n%40googlegroups.com.