[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Tu et al., 2022 - Google Patents

Variable-to-Variable Huffman Coding: Optimal and Greedy Approaches

Tu et al., 2022

View HTML
Document ID
2142801303951636171
Author
Tu K
Puchala D
Publication year
Publication venue
Entropy

External Links

Snippet

In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (ie, m-grams) sequences of symbols taken from the stream of input data for m> 1. We propose a procedure …
Continue reading at www.mdpi.com (HTML) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations

Similar Documents

Publication Publication Date Title
Hosseini et al. A survey on data compression methods for biological sequences
Verdú Empirical estimation of information measures: A literature guide
Maruyama et al. An online algorithm for lightweight grammar-based compression
Marshall et al. Formalising the pathways to life using assembly spaces
Rahman et al. Burrows–wheeler transform based lossless text compression using keys and Huffman coding
Weijs et al. HydroZIP: How hydrological knowledge can be used to improve compression of hydrological data
Mansouri et al. A new lossless DNA compression algorithm based on a single-block encoding scheme
Ignatoski et al. Comparison of entropy and dictionary based text compression in English, German, French, Italian, Czech, Hungarian, Finnish, and Croatian
Erdal et al. An efficient encoding algorithm using local path on huffman encoding algorithm for compression
Fajfar et al. Creation of numerical constants in robust gene expression programming
Nakahara et al. A stochastic model for block segmentation of images based on the quadtree and the Bayes code for it
Yamagiwa et al. Stream-based lossless data compression applying adaptive entropy coding for hardware-based implementation
Chmielowiec et al. Efficient inverted index compression algorithm characterized by faster decompression compared with the golomb-rice algorithm
Granada et al. Combining the Burrows-Wheeler transform and RCM-LDGM codes for the transmission of sources with memory at high spectral efficiencies
Klein et al. On the randomness of compressed data
Žalik et al. FLoCIC: A few lines of code for raster image compression
Tu et al. Variable-to-Variable Huffman Coding: Optimal and Greedy Approaches
Merhav A universal random coding ensemble for sample-wise lossy compression
Hucke et al. Approximation ratios of RePair, LongestMatch and Greedy on unary strings
Solano Donado On the optimal calculation of the Rice coding parameter
Nakamura et al. Linear-time text compression by longest-first substitution
Geiger The fractality of polar and reed–muller codes
Dong et al. Double polar codes for joint source and channel coding
Dai et al. An Efficient Lossless Compression Method for Periodic Signals Based on Adaptive Dictionary Predictive Coding
Abliz et al. A syllable-based technique for Uyghur text compression