Hamming distance of repeated-root constacyclic codes of length 2ps over Fpm+uFpm
Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring F p m + u F p m ( u 2 = 0 ) . The Hamming distances of all δ -constacyclic codes of length 2 p s over F p m + u F p m are completely determined. We provide some examples from which some codes have better parameters than the e...
Gespeichert in:
Veröffentlicht in: | Applicable algebra in engineering, communication and computing communication and computing, 2020, Vol.31 (3-4), p.291-305 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Let
p
be an odd prime, and
δ
be an arbitrary unit of the finite chain ring
F
p
m
+
u
F
p
m
(
u
2
=
0
)
. The Hamming distances of all
δ
-constacyclic codes of length
2
p
s
over
F
p
m
+
u
F
p
m
are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root
δ
-constacyclic codes of length
2
p
s
over
F
p
m
+
u
F
p
m
. |
---|---|
ISSN: | 0938-1279 1432-0622 |
DOI: | 10.1007/s00200-020-00432-0 |