On balanced codes
From MaRDI portal
Publication:3484768
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
(14)- Efficient m-ary balanced codes
- scientific article; zbMATH DE number 3861075 (Why is no real title available?)
- 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
- On efficient balanced codes over the mth roots of unity
- On optimal binary codes with unbalanced coordinates
- scientific article; zbMATH DE number 3463503 (Why is no real title available?)
- scientific article; zbMATH DE number 3463504 (Why is no real title available?)
- Parity codes
- On error-correcting balanced codes
- Design of some new efficient balanced codes
- Explicit, almost optimal, epsilon-balanced codes
- Theory and design ofm-ary balanced codes which are invariant under symbol permutation
- 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)