On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) (Q1732780)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) |
scientific article |
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