Transmission of Digital Information Along Channels with the Storage (Selected Articles)

摘要

Repeated codes have long ago been known. In this work Elayes shows that with the independent errors the probability of erroneous decoding can be done how conveniently small at the constant velocity transmission, if length and dimension of the repeated code unlimitedly grow. The connection of the parameters of the repeated code with the parameters of its subcodes was investigated by Slepian. Repeated and cascade codes can successfully be used both in channels with independent errors and in channels with errors, inclined to grouping. Its decoding is one of the principal problems during the application of any code. In the general case the decoding of the repeated and cascade codes is simplified due to their step by step decoding, i.e., first are decoded the codes of first stage. and then the second. However, the analysis of that how the corrective properties of the repeated or cascade code fully with this decoding are realized, in the literature is absent. (Russian translation)