Information compression and Varshamov-Gilbert bound

DOI10.1016/0890-5401(87)90008-3zbMath0637.94004OpenAlexW1993760477MaRDI QIDQ1099128

Rafail E. Krichevsky

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90008-3

zbMATH Keywords

channel with additive noisecollision indexcombinatorial sourceprogram complexity to enumerate a finite set of wordsVarshamov-Gilbert bound of the group error correcting code cardinality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding theorems (Shannon theory) (94A24)

Related Items (2)

Information compression and Varshamov-Gilbert bound ⋮ Effective entropies and data compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information compression and Varshamov-Gilbert bound
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Storing a sparse table
• Optimal hashing
• Fredman–Komlós bounds and information theory
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Enumerative source encoding

This page was built for publication: Information compression and Varshamov-Gilbert bound