Minimal cyclic codes of length \(2p^n\) (Q1290928): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/ffta.1998.0238 / rank | |||
| Property / cites work | |||
| Property / cites work: Semisimple cyclic and Abelian codes. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146667 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5337264 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal codes of prime-power length. / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/FFTA.1998.0238 / rank | |||
Normal rank | |||
Latest revision as of 17:36, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal cyclic codes of length \(2p^n\) |
scientific article |
Statements
Minimal cyclic codes of length \(2p^n\) (English)
0 references
9 June 2003
0 references
