Additive codes over Eisenstein chain rings are shown to correspond exactly, with duality preserved, to Z_p^e Z_p^{e-1}-linear codes, yielding enumeration formulas and small classifications for self-orthogonal, self-dual, and complementary-dual codes.
and Siap, I.: The structure of Z2Z2s-additive codes: Bounds on the minimum distance, Appl
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
Additive codes over Eisenstein chain rings are shown to correspond exactly, with duality preserved, to Z_p^e Z_p^{e-1}-linear codes, yielding enumeration formulas and small classifications for self-orthogonal, self-dual, and complementary-dual codes.