On balanced codes

DOI10.1109/18.52490MaRDI QIDQ3484768zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. Al-Bassam, Bella Bose

Publication date 1990

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

Full work available at URL https://doi.org/10.1109/18.52490

zbMATH Keywords

balanced codeKnuth's complementation methodParallel decoding

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• On error-correcting balanced codes
• Efficient balanced codes
• scientific article; zbMATH DE number 3463503
• Design of efficient balanced codes
• Balanced codes with parallel encoding and decoding
• Knuth's Balanced Codes Revisited
• Error-Correcting Balanced Knuth Codes
• Efficient m-ary balanced codes
• Design of some new efficient balanced codes
• Coding theory based on balancing polynomials

Cited in

(12)

• Theory and design ofm-ary balanced codes which are invariant under symbol permutation
• scientific article; zbMATH DE number 3463503 (Why is no real title available?)
• scientific article; zbMATH DE number 3463504 (Why is no real title available?)
• scientific article; zbMATH DE number 3861075 (Why is no real title available?)
• New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes
• On efficient high-order spectral-null codes over them-ary alphabet
• On optimal binary codes with unbalanced coordinates
• On error-correcting balanced codes
• Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
• Explicit, almost optimal, epsilon-balanced codes
• Parity codes
• On efficient balanced codes over the mth roots of unity

This page was built for publication: On balanced codes

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