Information compression and Varshamov-Gilbert bound
From MaRDI portal
Publication:1099128
DOI10.1016/0890-5401(87)90008-3zbMath0637.94004MaRDI QIDQ1099128
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
channel with additive noise; collision index; combinatorial source; program complexity to enumerate a finite set of words; Varshamov-Gilbert bound of the group error correcting code cardinality
Related Items
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