On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7041400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) |
scientific article; zbMATH DE number 7041400 |
Statements
On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (English)
0 references
25 March 2019
0 references
constacyclic code
0 references
generator polynomial
0 references
repeated-root code
0 references
simple-root code
0 references
Hamming distance
0 references
0 references
0 references
0 references
0 references
0.9320019483566284
0 references
0.9206116199493408
0 references
0.9067869186401368
0 references
0.89984530210495
0 references
0.8883607983589172
0 references
