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

Reani et al., 2012 - Google Patents

Data processing lower bounds for scalar lossy source codes with side information at the decoder

Reani et al., 2012

View PDF
Document ID
14747522801136535481
Author
Reani A
Merhav N
Publication year
Publication venue
2012 IEEE International Symposium on Information Theory Proceedings

External Links

Snippet

In this paper, we derive lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data …
Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

Classifications

    • 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
    • H03M7/4006—Conversion to or from arithmetic code
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • 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/3082—Vector coding
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2739—Permutation polynomial interleaver, e.g. quadratic permutation polynomial [QPP] interleaver and quadratic congruence interleaver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy

Similar Documents

Publication Publication Date Title
Pradhan et al. Distributed source coding using syndromes (DISCUS): Design and construction
US7233269B1 (en) Method and apparatus for constructing efficient codes for Wyner-Ziv video compression systems
Venkataramanan et al. Lossy compression via sparse linear regression: Computationally efficient encoding and decoding
US10382789B2 (en) Systems and methods for digital media compression and recompression
US20080048895A1 (en) Data Encoding and Decoding Using Slepian-Wolf Coded Nested Quantization to Achieve Wyner-Ziv Coding
Pradhan et al. Generalized coset codes for distributed binning
US7743309B2 (en) Distributed source coding with context
Grangetto et al. Distributed arithmetic coding for the Slepian–Wolf problem
No et al. Rateless lossy compression via the extremes
US7679536B2 (en) Method and apparatus for constructing efficient slepian-wolf codes with mismatched decoding
Napp et al. Faster decoding of rank metric convolutional codes
Goyal et al. On optimal permutation codes
Reani et al. Data processing lower bounds for scalar lossy source codes with side information at the decoder
Muramatsu Successive-cancellation decoding of binary polar codes based on symmetric parametrization
Yao et al. Optimality of polar codes in additive steganography under constant distortion profile
Kapetanović et al. Index assignment for multiple description repair in distributed storage systems
Nguyen et al. Single-bit quantization capacity of binary-input continuous-output channels
Liu et al. Polar lattices for lossy compression
Kaspi et al. Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side information.
Reani et al. Data-processing bounds for scalar lossy source codes with side information at the decoder
Li et al. Robust steganography based on polar codes
Yuan et al. Lossless Analog Compression via Polarization
Krithivasan et al. An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources
Kudryashov et al. Linear code-based vector quantization for independent random variables
Granada-Echeverria et al. Combining the Burrows-Wheeler Transform and RCM-LDGM Codes for the Transmission of Sources with Memory at High Spectral Efficiencies