Draper et al., 2013 - Google Patents
Lossless coding for distributed streaming sourcesDraper et al., 2013
View PDF- Document ID
- 15729535004839228254
- Author
- Draper S
- Chang C
- Sahai A
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
Distributed source coding is traditionally viewed in a block coding context wherein all source symbols are known in advance by the encoders. However, many modern applications to which distributed source coding ideas are applied, are better modeled as having streaming …
- 238000007476 Maximum Likelihood 0 abstract description 44
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
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
-
- 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
-
- 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
- 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
-
- 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/47—Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37
-
- 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
-
- 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
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hayashi | Second-order asymptotics in fixed-length source coding and intrinsic randomness | |
| Merhav | The generalized stochastic likelihood decoder: Random coding and expurgated bounds | |
| Alajaji et al. | An introduction to single-user information theory | |
| Draper et al. | Lossless coding for distributed streaming sources | |
| Kostina | Lossy data compression: Nonasymptotic fundamental limits | |
| Tang et al. | Capacity of noisy permutation channels | |
| Tan | On the reliability function of the discrete memoryless relay channel | |
| Yuan et al. | Exploring the benefits of cross-modal coding | |
| Weinberger et al. | Optimum tradeoffs between the error exponent and the excess-rate exponent of variable-rate Slepian–Wolf coding | |
| Muramatsu | Variable-length lossy source code using a constrained-random-number generator | |
| Yang et al. | Interactive encoding and decoding for one way learning: Near lossless recovery with side information at the decoder | |
| Weissman et al. | Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence | |
| Natarajan et al. | Locally decodable index codes | |
| Lee et al. | Exact moderate deviation asymptotics in streaming data transmission | |
| Merhav | Finite–State Source–Channel Coding for Individual Source Sequences With Source Side Information at the Decoder | |
| Haroutunian | On Bounds for $ E $-capacity of DMC | |
| Gibson | Information theory and rate distortion theory for communications and compression | |
| Soljanin | Compressing quantum mixed-state sources by sending classical information | |
| Kaspi et al. | Zero-delay and causal single-user and multi-user lossy source coding with decoder side information | |
| Bidgoli et al. | Excess rate for model selection in interactive compression using belief propagation decoding | |
| Chang et al. | Lossless coding for distributed streaming sources | |
| Yang et al. | Indirect lossy source coding with observed source reconstruction: Nonasymptotic bounds and second-order asymptotics | |
| Steinberg et al. | On hierarchical joint source-channel coding with degraded side information | |
| Truong et al. | Moderate deviation asymptotics for variable-length codes with feedback | |
| Kourtellaris | Nonanticipative information theory |