On perfect codes for an additive channel

DOI10.1134/S0032946008040029MaRDI QIDQ734268zbMATH OpenFDO

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

Publication date 20 October 2009

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946008040029

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites work

• scientific article; zbMATH DE number 3496008 (Why is no real title available?)
• scientific article; zbMATH DE number 3415961 (Why is no real title available?)
• On the Number of 1-Perfect Binary Codes: A Lower Bound

Cited in

(5)

• Classification of subsets of \(B^n\) and additive channels
• Addendum to: J. M. van den Akker, et al., Perfect codes with distinct protective radii
• On binary 1-perfect additive codes: some structural properties
• A characterization of 1-perfect additive codes
• Nearly optimal multiuser codes for the binary adder channel

This page was built for publication: On perfect codes for an additive channel

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