Repeated-root constacyclic codes of length \(2 \ell^m p^n\) (Q2011488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Repeated-root constacyclic codes of length 2 ^m p^n |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Repeated-root constacyclic codes of length \(2 \ell^m p^n\) |
scientific article |
Statements
Repeated-root constacyclic codes of length \(2 \ell^m p^n\) (English)
0 references
3 August 2017
0 references
finite field
0 references
constacyclic code
0 references
cyclic code
0 references
negacyclic code
0 references
dual code
0 references
generator polynomial
0 references
0 references
0 references
0.941289246082306
0 references
0.9405322670936584
0 references
0.9401088953018188
0 references
0.9300408959388732
0 references
0.9289712905883788
0 references
