Some cyclic codes of length \(2p^n\) (Q634132): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1675044 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: W. David Joyner / rank | |||
Normal rank |
Revision as of 04:45, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some cyclic codes of length \(2p^n\) |
scientific article |
Statements
Some cyclic codes of length \(2p^n\) (English)
0 references
2 August 2011
0 references
The authors consider the ideals of the ring \(\text{GF}(q)[x]/(x^{m}-1)\), where \(m=2p^n\), \(p,q\) are distinct primes, \(n\geq 1\) is an integer, and \(q\) has multiplicative order \(\varphi(m)/2 \pmod m\). The generator polynomials, the dimension, the minimum distance of cyclic codes of length \(2p^n\) generated by primitive idempotents of this ring are discussed.
0 references
error-correcting codes
0 references
cyclic codes
0 references
cyclotomic cosets
0 references
dual codes
0 references