Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (Q1945151): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theorems for individual sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kraft Inequality and Arithmetic Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Arithmetic Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good codes based on very sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of source coding with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed rate universal block source coding with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distortion-rate theory for individual sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal almost sure data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-slope universal lossy data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vector quantization approach to universal noiseless coding and quantization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for source coding subject to a fidelity criterion, based on string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural type selection in adaptive lossy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimal lossy data compression based on approximate pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance of data compression algorithms based upon string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotics of waiting times between stationary processes, allowing distortion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coding theorem for lossy data compression by LDPC codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Sparse-Graph Codes for Lossy Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable complexity-performance tradeoffs in lossy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree encoding of memoryless time-discrete sources with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-cycle algorithm for source coding with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trellis Encoding of memoryless discrete-time sources with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and evaluation of trellis-coded quantizers for memoryless sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source coding, large deviations, and approximate pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pointwise redundancy in lossy data compression and universal lossy data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686615 / rank
 
Normal rank

Latest revision as of 07:32, 6 July 2024

scientific article
Language Label Description Also known as
English
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
scientific article

    Statements

    Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (English)
    0 references
    0 references
    0 references
    3 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers