Universal codeword sets and representations of the integers

DOI10.1109/TIT.1975.1055349zbMath0298.94011OpenAlexW2128777897WikidataQ55880622 ScholiaQ55880622MaRDI QIDQ4053461

Peter Eliaš

Publication date: 1975

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1975.1055349

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (89)

Faster average case low memory semi-external construction of the Burrows-Wheeler transform ⋮ Better distance labeling for unweighted planar graphs ⋮ Compressed matching for feature vectors ⋮ The space complexity of sum labelling ⋮ Online Multi-Coloring with Advice ⋮ Unnamed Item ⋮ Binary codes for locally homogeneous sequences ⋮ Random access to Fibonacci encoded files ⋮ Space efficient data structures for nearest larger neighbor ⋮ Grammar index by induced suffix sorting ⋮ How to Share a Secret, Infinitely ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ The myriad virtues of wavelet trees ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ A space efficient direct access data structure ⋮ Graph compression by BFS ⋮ Towards efficient positional inverted index ⋮ Weighted forward looking adaptive coding ⋮ An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle ⋮ The use and usefulness of numeration systems ⋮ Robust universal complete codes for transmission and compression ⋮ Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ On the succinct representation of equivalence classes ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ Space Efficient Data Structures for Nearest Larger Neighbor ⋮ Time series compression based on reinforcement learning ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Unnamed Item ⋮ Efficient Compression of Web Graphs ⋮ Fast decoding algorithms for variable-lengths codes ⋮ Bidirectional adaptive compression ⋮ Enhanced ternary Fibonacci codes ⋮ Lempel-Ziv-like parsing in small space ⋮ EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING ⋮ Generating \((2,3)\)-codes ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Two-base numeration systems ⋮ Recent Developments in Floorplan Representations ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Online coloring of bipartite graphs with and without advice ⋮ Better distance labeling for unweighted planar graphs ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ Compressed data structures: Dictionaries and data-aware measures ⋮ Rank and select revisited and extended ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Unnamed Item ⋮ Is Huffmann coding dead? ⋮ On the advice complexity of the online dominating set problem ⋮ Communication algorithms with advice ⋮ Robust prefix encoding using lower \((2,3)\) number representation ⋮ Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems ⋮ Dynamic asymmetric communication ⋮ Sorting streamed multisets ⋮ A lower bound on compression of unknown alphabets ⋮ The space complexity of sum labelling ⋮ Compression in the presence of shared data ⋮ Optimal encoding of non-stationary sources ⋮ Redundancy estimates for the Lempel–Ziv algorithm of data compression ⋮ COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS ⋮ Move-to-front, distance coding, and inversion frequencies revisited ⋮ Long range variations on the Fibonacci universal code ⋮ Second step algorithms in the Burrows-Wheeler compression algorithm ⋮ An almost optimal algorithm for unbounded searching ⋮ Online Minimum Spanning Tree with Advice ⋮ Forward looking Huffman coding ⋮ Orthogonal range searching in linear and almost-linear space ⋮ Short encodings of planar graphs and maps ⋮ A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES ⋮ Labeling schemes for tree representation ⋮ Risk inflation of sequential tests controlled by alpha investing ⋮ Optimal data compression algorithm ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms ⋮ Fast Compressed Tries through Path Decompositions ⋮ The coding complexity of Lévy processes ⋮ Universal Data Compression Algorithm Based on Approximate String Matching ⋮ Computable Bayesian Compression for Uniformly Discretizable Statistical Models ⋮ The teaching size: computable teachers and learners for universal languages ⋮ Integer representation in the mixed base \((2,3)\) ⋮ Bicriteria Data Compression ⋮ Unnamed Item ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ DenseZDD: a compact and fast index for families of sets ⋮ Searching and encoding for infinite ordered sets ⋮ Space-efficient Huffman codes revisited ⋮ Syntactic compression codes at the zero entropy point ⋮ New compression schemes for natural number sequences ⋮ Universal coding for memoryless sources with countably infinite alphabets ⋮ Online multi-coloring with advice

This page was built for publication: Universal codeword sets and representations of the integers