Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms

DOI10.1080/09720529.2005.10698052zbMath1090.94028OpenAlexW1994176074MaRDI QIDQ3379155

L. G. Tallini, Raffaele Mascella

Publication date: 6 April 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.2005.10698052

zbMATH Keywords

\(m\)-ary alphabetline codes\(m\)-th roots of unitybipolar alphabetDC-free communication

Mathematics Subject Classification ID

Other types of codes (94B60)

Cites Work

• Unnamed Item
• Efficient \(m\)-ary balanced codes
• Efficient balanced codes
• High-order spectral-null codes-constructions and bounds
• Design of some new efficient balanced codes
• Balancing sets of vectors

This page was built for publication: Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms