Design of some new efficient balanced codes

DOI10.1109/18.490545MaRDI QIDQ4887058zbMATH OpenOpenAlexFDO

Authors L. G. Tallini, Renato M. Capocelli, Bella Bose

Publication date 31 July 1996

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

Full work available at URL https://semanticscholar.org/paper/694441fc94b40faed77b9ba712c4febf60c0e774

zbMATH Keywords

balanced codeunidirectional errorsDC-free codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Other types of codes (94B60)

Recommendations

• On balanced codes
• Efficient \(m\)-ary balanced codes
• On error-correcting balanced codes
• scientific article; zbMATH DE number 3463504
• Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms

Cited in

(10)

• Theory and design ofm-ary balanced codes which are invariant under symbol permutation
• On balanced codes
• scientific article; zbMATH DE number 3463504 (Why is no real title available?)
• Equireplicate balanced binary codes for oligo arrays
• On efficient high-order spectral-null codes over them-ary alphabet
• On error-correcting balanced codes
• Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
• On efficient balanced codes over the mth roots of unity
• Efficient \(m\)-ary balanced codes
• On linear balancing sets

This page was built for publication: Design of some new efficient balanced codes

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