Design of some new efficient balanced codes

DOI10.1109/18.490545zbMATH Open0857.94022OpenAlexW2026712187MaRDI QIDQ4887058FDOQ4887058

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

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

zbMATH Keywords

balanced codeunidirectional errorsDC-free codes

Mathematics Subject Classification ID

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

Cited In (10)

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

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)