The use and usefulness of numeration systems
type: Item
instance of: scholarly article
title: The use and usefulness of numeration systems
zbMATH Open document ID: 0672.10008
DOI: 10.1016/0890-5401(89)90028-X
author: Aviezri S. Fraenkel
published in: Information and Computation
publication date: 1989-01-01T00:00:00Z
review text: The author shows how different number systems can be used in solving some practical and some pure theoretical mathematical problems. The problems he considers come from Information Theory (Data compression and the design of comma free codes), Group Theory, Game Theory (Description of strategies for games and descriptions of classes of games) and Combinatorics (ranking of permutations and combinations).
Mathematics Subject Classification ID: 11A63
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 11B75
zbMATH DE Number: 4099404
zbMATH Keywords: combinatorial group theory
zbMATH Keywords: compression of sparse binary strings
zbMATH Keywords: encoding of contiguous binary strings of unknown lengths
zbMATH Keywords: strategies of games
zbMATH Keywords: numeration system
zbMATH Keywords: ranking of permutations and combinations
reviewed by: Herman J. Tiersma
MaRDI profile type: Publication
cites work: Robust transmission of unbounded strings using Fibonacci representations
cites work: A non-analytic proof of the Newman-Znám result for disjoint covering systems
cites work: On irregularities of distribution of real sequences
cites work: Universal codeword sets and representations of the integers
cites work: Q5672651
cites work: Economical encoding of commas between strings
cites work: Self-synchronizing Huffman codes (Corresp.)
cites work: New Proof of the Generalized Chinese Remainder Theorem
cites work: How to Beat Your Wythoff Games' Opponent on Three Fronts
cites work: Wythoff games, continued fractions, cedar trees and Fibonacci searches
cites work: Systems of Numeration
cites work: Combinatorial Compression and Partitioning of Large Dictionaries
cites work: Maximal Prefix-Synchronized Codes
cites work: Huffman coding in bit-vector compression
cites work: Generation of Permutations by Adjacent Transposition
cites work: Q5585020
cites work: Axioms and hulls
cites work: Q5519904
cites work: Q5615076
cites work: Cayley permutations
cites work: On the generation of permutations
cites work: Linear Algorithm for Data Compression via String Matching
cites work: Q5615842
cites work: On a periodic maintenance problem
cites work: Generation of Permutations by Transposition
cites work: Q5524370
cites work: Q5665234
description: scientific article; zbMATH DE number 4099404