1976/05/01 by J. Rissanen, J. J. Rissanen · 9 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithm #Algorithms and Data Compression #Alphabet #Arithmetic #Coding (social sciences) #Computer science #DNA and Biological Computing #Discrete mathematics #Linguistics #Mathematics #Philosophy #Statistics #semigroups and automata theory
paper · doi:10.1147/rd.203.0198
crossref issued 1976/05/01 · crossref published 1976/05/01 · crossref published-print 1976/05/01 · openalex publication_date 1976/05/01 · crossref created 2010/04/05 · openalex created_date 2025/10/10 · crossref deposited 2025/10/20 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/05
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers lias parameters such that ∑i2−li≤2−ε. This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within ε. The coding speed is comparable to that of conventional coding methods.