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

DOI10.1080/09720529.2005.10698052zbMATH Open1090.94028OpenAlexW1994176074MaRDI QIDQ3379155FDOQ3379155

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

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

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

• Title not available (Why is that?)
• Efficient balanced codes
• Efficient \(m\)-ary balanced codes
• High-order spectral-null codes-constructions and bounds
• Balancing sets of vectors
• Design of some new efficient balanced codes

Cited In (2)

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

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)