Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule

@article{Hashimoto1999CompositeSL,
  title={Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule},
  author={T. Hashimoto},
  journal={IEEE Trans. Inf. Theory},
  year={1999},
  volume={45},
  pages={78-93}
}
  • T. Hashimoto
  • Published 1999
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • For decoding with erasures, Forney's scheme is known to be optimal in the sense that no other scheme can make the erasure probability P/sub ers/ and undetected error probability P/sub uer/ simultaneously smaller. We propose a scheme for erasure decision which tests the likelihood ratio as well as the likelihood itself and show that the attainable upper bounds on P/sub ers/ and P/sub uer/ are the same as those proved for the optimal scheme up to a constant factor. We also show that the scheme… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
    • 39
    • Open Access
    Minimax Universal Decoding With an Erasure Option
    • 19
    • Open Access
    Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
    • 26
    • Open Access
    Exact Random Coding Exponents for Erasure Decoding
    • 25
    • Open Access
    Exact Random Coding Exponents for Erasure Decoding
    • 12
    • Open Access
    Performance bounds for erasure, list and feedback schemes with linear block codes
    • 10
    • Open Access
    Simplified erasure/list decoding
    • 4
    • Highly Influenced
    • Open Access
    On the complexity of suboptimal decoding for list and decision feedback schemes
    • 4
    • Open Access
    An algorithm for detecting unreliable code sequence segments and its applications
    • 10

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    Efficient maximum likelihood decoding of linear block codes using a trellis
    • 565
    • Open Access
    Convolutional Codes II. Maximum-Likelihood Decoding
    • 261
    • Open Access
    Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition
    • 1,862
    • Highly Influential
    On the error exponent of convolutionally coded ARQ
    • 20
    Bayesian methods for erasure insertion in frequency-hop communication systems with partial-band interference
    • 106
    A Robust Ratio-Threshold Technique to Mitigate Tone and Partial Band Jamming in Coded MFSK Systems
    • 190
    Viterbi decoding algorithm for convolutional codes with repeat request
    • 130
    • Open Access
    Coupled Decoding of Block-Convolutional Concatenated Codes
    • 18