On balanced codes
From MaRDI portal
Publication:3484768
DOI10.1109/18.52490zbMATH Open0704.94023DBLPjournals/tit/Al-BassamB90OpenAlexW2068651225WikidataQ29038497 ScholiaQ29038497MaRDI QIDQ3484768FDOQ3484768
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
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)
- Explicit, almost optimal, epsilon-balanced codes
- Parity 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
- Title not available (Why is that?)
- 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?)
- Title not available (Why is that?)
- On error-correcting balanced codes
- On optimal binary codes with unbalanced coordinates
- New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes
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)
