Universal codeword sets and representations of the integers

From MaRDI portal
Publication:4053461

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




Related Items (89)

Faster average case low memory semi-external construction of the Burrows-Wheeler transformBetter distance labeling for unweighted planar graphsCompressed matching for feature vectorsThe space complexity of sum labellingOnline Multi-Coloring with AdviceUnnamed ItemBinary codes for locally homogeneous sequencesRandom access to Fibonacci encoded filesSpace efficient data structures for nearest larger neighborGrammar index by induced suffix sortingHow to Share a Secret, InfinitelyON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROACThe myriad virtues of wavelet treesAdjacency Labeling Schemes and Induced-Universal GraphsA space efficient direct access data structureGraph compression by BFSTowards efficient positional inverted indexWeighted forward looking adaptive codingAn Introduction to Coding Theory and the Two-Part Minimum Description Length PrincipleThe use and usefulness of numeration systemsRobust universal complete codes for transmission and compressionPractical and flexible pattern matching over Ziv-Lempel compressed text.On the succinct representation of equivalence classesNew variable-length data compression scheme for solution representation of meta-heuristicsA Technique to Obtain Hardness Results for Randomized Online Algorithms – A SurveySpace Efficient Data Structures for Nearest Larger NeighborTime series compression based on reinforcement learningEntropy and compression: a simple proof of an inequality of Khinchin-Ornstein-ShieldsUnnamed ItemEfficient Compression of Web GraphsFast decoding algorithms for variable-lengths codesBidirectional adaptive compressionEnhanced ternary Fibonacci codesLempel-Ziv-like parsing in small spaceEFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHINGGenerating \((2,3)\)-codesTextual data compression in computational biology: algorithmic techniquesTwo-base numeration systemsRecent Developments in Floorplan Representationsm-Bonsai: A Practical Compact Dynamic TrieOnline coloring of bipartite graphs with and without adviceBetter distance labeling for unweighted planar graphsA simpler analysis of Burrows-Wheeler-based compressionCompressed data structures: Dictionaries and data-aware measuresRank and select revisited and extendedBurrows-Wheeler transform and LCP array construction in constant spaceUnnamed ItemIs Huffmann coding dead?On the advice complexity of the online dominating set problemCommunication algorithms with adviceRobust prefix encoding using lower \((2,3)\) number representationDigits and continuants in Euclidean algorithms. Ergodic versus Tauberian theoremsDynamic asymmetric communicationSorting streamed multisetsA lower bound on compression of unknown alphabetsThe space complexity of sum labellingCompression in the presence of shared dataOptimal encoding of non-stationary sourcesRedundancy estimates for the Lempel–Ziv algorithm of data compressionCOMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONSMove-to-front, distance coding, and inversion frequencies revisitedLong range variations on the Fibonacci universal codeSecond step algorithms in the Burrows-Wheeler compression algorithmAn almost optimal algorithm for unbounded searchingOnline Minimum Spanning Tree with AdviceForward looking Huffman codingOrthogonal range searching in linear and almost-linear spaceShort encodings of planar graphs and mapsA LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIESLabeling schemes for tree representationRisk inflation of sequential tests controlled by alpha investingOptimal data compression algorithmAllocate-On-Use Space Complexity of Shared-Memory AlgorithmsFast Compressed Tries through Path DecompositionsThe coding complexity of Lévy processesUniversal Data Compression Algorithm Based on Approximate String MatchingComputable Bayesian Compression for Uniformly Discretizable Statistical ModelsThe teaching size: computable teachers and learners for universal languagesInteger representation in the mixed base \((2,3)\)Bicriteria Data CompressionUnnamed ItemFrom Time to Space: Fast Algorithms That Yield Small and Fast Data StructuresDenseZDD: a compact and fast index for families of setsSearching and encoding for infinite ordered setsSpace-efficient Huffman codes revisitedSyntactic compression codes at the zero entropy pointNew compression schemes for natural number sequencesUniversal coding for memoryless sources with countably infinite alphabetsOnline multi-coloring with advice




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