Merhav, 2017 - Google Patents
The generalized stochastic likelihood decoder: Random coding and expurgated boundsMerhav, 2017
View PDF- Document ID
- 3177102398933894345
- Author
- Merhav N
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this paper, we study a generalized version of this decoder, where the posterior is …
- 238000009826 distribution 0 abstract description 27
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
- 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
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
-
- 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
-
- 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
-
- 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
-
- 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
-
- 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/27—Automatic analysis, e.g. parsing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
-
- 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
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Merhav | The generalized stochastic likelihood decoder: Random coding and expurgated bounds | |
| Merhav | List decoding—Random coding exponents and expurgated exponents | |
| Liu et al. | $ E_ {{\gamma}} $-Resolvability | |
| Merhav et al. | Universal randomized guessing with application to asynchronous decentralized brute–force attacks | |
| Stavrou et al. | A rate distortion approach to goal-oriented communication | |
| Merhav | Error exponents of typical random codes | |
| Somekh-Baruch | A general formula for the mismatch capacity | |
| Merhav | Exact random coding error exponents of optimal bin index decoding | |
| Somekh-Baruch et al. | Exact random coding exponents for erasure decoding | |
| Merhav | Ensemble performance of biometric authentication systems based on secret key generation | |
| Merhav | A Lagrange–dual lower bound to the error exponent of the typical random code | |
| Fong et al. | Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approach | |
| Tan | On the reliability function of the discrete memoryless relay channel | |
| Merhav | Universal decoding for arbitrary channels relative to a given class of decoding metrics | |
| Draper et al. | Lossless coding for distributed streaming sources | |
| Averbuch et al. | Exact random coding exponents and universal decoders for the asymmetric broadcast channel | |
| Tamir et al. | Universal decoding for the typical random code and for the expurgated code | |
| Merhav | Erasure/list exponents for Slepian–Wolf decoding | |
| Bondaschi et al. | A revisitation of low-rate bounds on the reliability function of discrete memoryless channels for list decoding | |
| Natarajan et al. | Locally decodable index codes | |
| Merhav et al. | Codebook mismatch can be fully compensated by mismatched decoding | |
| Merhav | False-accept/false-reject trade-offs for ensembles of biometric authentication systems | |
| Merhav | Finite–State Source–Channel Coding for Individual Source Sequences With Source Side Information at the Decoder | |
| Wu et al. | Successive refinement of Shannon cipher system under maximal leakage | |
| Wu et al. | Improving on the cut-set bound for general primitive relay channels |