RANDOM CODING BOUND FOR CHANNELS WITH MEMORY-DECODING FUNCTION WITH PARTIAL OVERLAPPING Part 1. Derivation of Main Expression
Abstract
Introduction: The problem of calculating the random coding exponent in the full range of code rates for finite-state channels is not completely solved and remains relevant. It seems that a good approximation to the optimal random coding exponent can be found by using a mismatched decoding function. Purpose: Deriving a random coding exponent close to the optimal one. Results: A new random coding bound is presented for a wide class of channels, including those for which the complete random coding exponent was not previously derived. The derivation of this bound is based on the use of a mismatched decoding function which depends on two parameters: the length W of the segment of the channel output sequence and the length B of the segment of the channel input sequence. The values of W and B greatly influence the values of the random coding exponent and the complexity of its calculation.Published
2018-06-01
How to Cite
Trofimov, A. (2018). RANDOM CODING BOUND FOR CHANNELS WITH MEMORY-DECODING FUNCTION WITH PARTIAL OVERLAPPING Part 1. Derivation of Main Expression. Information and Control Systems, (3), 79-88. https://doi.org/10.15217/issn1684-8853.2018.3.79
Issue
Section
Information coding and transmission