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

No et al., 2016 - Google Patents

Strong successive refinability and rate-distortion-complexity tradeoff

No et al., 2016

View PDF
Document ID
12196567296823235341
Author
No A
Ingber A
Weissman T
Publication year
Publication venue
IEEE Transactions on Information Theory

External Links

Snippet

We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similar to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if successive refinement coding can …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • 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
    • 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/4031—Fixed length to variable length coding
    • H03M7/4037—Prefix coding
    • 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/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/13—Linear 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/14—Conversion to or from non-weighted 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/02—Conversion to or from weighted codes, i.e. the weight given to a digit depending on the position of the digit within the block or code word
    • 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
    • H03M3/00—Conversion of analogue values to or from differential modulation
    • H03M3/02—Delta modulation, i.e. one-bit differential modulation
    • H03M3/022—Delta modulation, i.e. one-bit differential modulation with adaptable step size, e.g. adaptive delta modulation [ADM]
    • H03M3/024—Delta modulation, i.e. one-bit differential modulation with adaptable step size, e.g. adaptive delta modulation [ADM] using syllabic companding, e.g. continuously variable slope delta modulation [CVSD]
    • 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators

Similar Documents

Publication Publication Date Title
No et al. Strong successive refinability and rate-distortion-complexity tradeoff
Honda et al. Polar coding without alphabet extension for asymmetric models
Liu et al. $ E_ {{\gamma}} $-Resolvability
Lapidoth et al. Sending a bivariate Gaussian over a Gaussian MAC
Ordentlich et al. A simple proof for the existence of “good” pairs of nested lattices
Benammar et al. Multi-kernel polar codes: Proof of polarization and error exponents
Venkataramanan et al. Lossy compression via sparse linear regression: Computationally efficient encoding and decoding
No et al. Rateless lossy compression via the extremes
Hayashi et al. Asymmetric evaluations of erasure and undetected error probabilities
Dembo et al. The minimax distortion redundancy in noisy source coding
Liu et al. Polar lattices for lossy compression
Gavalakis et al. Fundamental limits of lossless data compression with side information
Bross et al. The rate-and-state capacity with feedback
US7679536B2 (en) Method and apparatus for constructing efficient slepian-wolf codes with mismatched decoding
Gupta et al. Rate-distortion in near-linear time
Renes Tight lower bound on the error exponent of classical-quantum channels
Basu et al. Hypergraph-based source codes for function computation under maximal distortion
Liu et al. Polar lattices for lossy compression
Wang et al. A strong converse for joint source-channel coding
Baron et al. Redundancy rates of Slepian-Wolf coding
Kudryashov et al. Linear code-based vector quantization for independent random variables
Kuzuoka et al. A dichotomy of functions in distributed coding: An information spectral approach
Cassuto et al. Efficient compression of long arbitrary sequences with no reference at the encoder
Bai et al. Achievable second-order asymptotics for successive refinement using Gaussian codebooks
Bross Secure cooperative source-coding with side information at the eavesdropper