Perfect codes in additive channels

DOI10.1134/S1064562406060123MaRDI QIDQ610513zbMATH OpenFDO

Authors V. K. Leont'ev, G. L. Movsisyan, Zh. G. Margaryan

Publication date 8 December 2010

Published in Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 6516526
• Perfect codes from the dual point of view. I
• \(e\)-perfect codes
• A survey of perfect codes
• Perfect codes in the discrete simplex

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• On the Nonexistence of Perfect Codes over Finite Fields

Cited in

(8)

• Perfect codes in the discrete simplex
• Codes for perfectly correcting errors of limited size
• On binary 1-perfect additive codes: some structural properties
• Classification of subsets of \(B^n\) and additive channels
• A broad class of additive error coding, channels and lower bound on the probability of error for block codes using SK-metric
• On the construction of perfect codes from \textit{HEX} signal constellations
• Addendum to: J. M. van den Akker, et al., Perfect codes with distinct protective radii
• A characterization of 1-perfect additive codes

This page was built for publication: Perfect codes in additive channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610513)