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

DOI10.1080/09720529.2005.10698052MaRDI QIDQ3379155zbMATH OpenOpenAlexFDO

Authors Raffaele Mascella, L. G. Tallini

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)

Recommendations

• On efficient balanced codes over the mth roots of unity
• Design of some new efficient balanced codes
• scientific article; zbMATH DE number 3463503
• Efficient m-ary balanced codes
• On balanced codes

Cites work

• scientific article; zbMATH DE number 5995471 (Why is no real title available?)
• Balancing sets of vectors
• Design of some new efficient balanced codes
• Efficient \(m\)-ary balanced codes
• Efficient balanced codes
• High-order spectral-null codes-constructions and bounds

Cited in

(2)

• On efficient balanced codes over the mth roots of unity
• On linear balancing sets

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

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