The use and usefulness of numeration systems
From MaRDI portal
Publication:1119959
DOI10.1016/0890-5401(89)90028-XzbMath0672.10008MaRDI QIDQ1119959
Publication date: 1989
Published in: Information and Computation (Search for Journal in Brave)
combinatorial group theorynumeration systemcompression of sparse binary stringsencoding of contiguous binary strings of unknown lengthsranking of permutations and combinationsstrategies of games
Other combinatorial number theory (11B75) Radix representation; digital problems (11A63) Information theory (general) (94A15)
Related Items
The non-power model of the genetic code: a paradigm for interpreting genomic information ⋮ \(\beta\)-shift, numeration systems, and automata ⋮ Robust universal complete codes for transmission and compression ⋮ Generating \((2,3)\)-codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- Cayley permutations
- A non-analytic proof of the Newman-Znám result for disjoint covering systems
- Axioms and hulls
- On the generation of permutations
- Huffman coding in bit-vector compression
- On a periodic maintenance problem
- Robust transmission of unbounded strings using Fibonacci representations
- Generation of Permutations by Transposition
- Self-synchronizing Huffman codes (Corresp.)
- Combinatorial Compression and Partitioning of Large Dictionaries
- Systems of Numeration
- Linear Algorithm for Data Compression via String Matching
- On irregularities of distribution of real sequences
- Universal codeword sets and representations of the integers
- Economical encoding of commas between strings
- Maximal Prefix-Synchronized Codes
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- Generation of Permutations by Adjacent Transposition
- New Proof of the Generalized Chinese Remainder Theorem
