Theory and design ofm-ary balanced codes which are invariant under symbol permutation

DOI10.1080/09720529.2006.10698071zbMath1093.94031OpenAlexW2101997309MaRDI QIDQ5473104

L. G. Tallini, Raffaele Mascella

Publication date: 19 June 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698071

zbMATH Keywords

digital communicationdata integritydelay-insensitive communication\(m\)-ary alphabetline codes\(m\)-th roots of unityDC-free communication\(m\)-ary communicationasymmetric/unidirectional error detection/correction

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Efficient \(m\)-ary balanced codes
• On efficient balanced codes over the mth roots of unity
• Efficient balanced codes
• Coding for delay-insensitive communication with partial synchronization
• Design of some new efficient balanced codes
• Enumerative source encoding

This page was built for publication: Theory and design ofm-ary balanced codes which are invariant under symbol permutation