Efficient \(m\)-ary balanced codes

DOI10.1016/S0166-218X(98)00129-2zbMath1053.94019MaRDI QIDQ1283068

L. G. Tallini, Ugo Vaccaro

Publication date: 4 February 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Decoding\(m\)-ary alphabetBalanced codesEncodingHigh-order spectral-null codesImmutable codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (4)

Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency ⋮ Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms ⋮ On efficient high-order spectral-null codes over them-ary alphabet ⋮ Theory and design ofm-ary balanced codes which are invariant under symbol permutation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient \(q\)-ary immutable codes
• Matched spectral-null codes for partial-response channels
• Efficient balanced codes
• Optimal Unidirectional Error Detecting/Correcting Codes
• Design of some new efficient balanced codes
• Design of efficient balanced codes
• On unordered codes
• Enumerative source encoding
• A class of codes for asymmetric channels and a problem from the additive theory of numbers

This page was built for publication: Efficient \(m\)-ary balanced codes