Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (Q780367)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) |
scientific article |
Statements
Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) (English)
0 references
15 July 2020
0 references
repeated-root codes
0 references
constacyclic codes
0 references
Hamming distance
0 references
finite chain rings
0 references
0 references
0 references
0 references
