zbMATH — the first resource for mathematics

To the theory of low-density convolutional codes. I. (English. Russian original) Zbl 0980.94031
Probl. Inf. Transm. 35, No. 4, 295-310 (1999); translation from Probl. Peredachi Inf. 35, No. 4, 12-28 (1999).
Selected properties of low-density convolutional (LDC) codes are investigated. The authors analyze a special statistical set of LDC codes described by Markov equations. For such codes the lower bound of free distance and upper bounds for decoding error probability are evaluated. The authors also propose and analyze an iterative decoding algorithm, with hard decisions for homogeneous LDC codes of rate 1/2. Additionally, they compare the complexity characteristics of convolutional turbo- and LDC codes, verifying the analytical results via simulation experiments.
94B10 Convolutional codes
94B35 Decoding
94B70 Error probability in coding theory
68Q25 Analysis of algorithms and problem complexity