RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1986 Volume 22, Issue 4, Pages 9–28 (Mi ppi954)

This article is cited in 1 paper

Information Theory and Coding Theory

Generalized Unit-Memory Convolutional Concatenated Codes

V. V. Zyablov, S. A. Shavgulidze


Abstract: We develop and analyze a concatenated coding system with inner unit-memory convolutional codes and outer Reed–Solomon codes. We prove the existence of embedded inner code systems in which the main code and all the subcodes have optimal error-correcting properties. We investigate an inner-code decoding algorithm which allows erasures, and tradeoff relations are obtained for error and erasure probabilities. These results lead to the development of a concatenated decoding algorithm for generalized unit-memory convolutional concatenated codes and produce bounds on the decoding error exponent of this algorithm. A bound on decoding complexity of these codes is given.

UDC: 621.391.15

Received: 12.04.1985


 English version:
Problems of Information Transmission, 1986, 22:4, 256–271

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026