2013/01/28 by Jos H. Weber, Kees A. Schouhamer Immink, Weber, Jos H. +5 · 6 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Algorithm #Block code #Coding theory and cryptography #Combinatorics #Computer science #DNA and Biological Computing #Decoding methods #Discrete mathematics #Encoder #Expander code #FOS: Computer and information sciences #Information Theory (cs.IT) #Linear code #Mathematics #Redundancy (engineering) #Statistics #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1301.6484
published in arXiv (Cornell University) (Cornell University) · 12 pages
arxiv created 2013/01/28 · openalex publication_date 2013/01/28 · arxiv updated 2013/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We examine and compare several different classes of "balanced" block codes over q-ary alphabets, namely symbol-balanced (SB) codes, charge-balanced (CB) codes, and polarity-balanced (PB) codes. Known results on the maximum size and asymptotic minimal redundancy of SB and CB codes are reviewed. We then determine the maximum size and asymptotic minimal redundancy of PB codes and of codes which are both CB and PB. We also propose efficient Knuth-like encoders and decoders for all these types of balanced codes.