On efficient balanced codes over the mth roots of unity

DOI10.1109/TIT.2006.872981MaRDI QIDQ3547334zbMATH OpenFDO

Authors Raffaele Mascella, L. G. Tallini, S. Al-Bassam, Bella Bose

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclotomic extensions (11R18)

Recommendations

• Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
• Efficient m-ary balanced codes
• Design of some new efficient balanced codes
• On optimal binary codes with unbalanced coordinates
• On balanced codes

Cited in

(3)

• Explicit, almost optimal, epsilon-balanced codes
• Theory and design ofm-ary balanced codes which are invariant under symbol permutation
• Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms

This page was built for publication: On efficient balanced codes over the mth roots of unity

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