This article is cited in 1 paper

Coding Theory

Decoding of Low-Density Codes

S. I. Kovalev


Abstract: We consider decoding of low-density parity-check codes by the Zyablov–Pinsker algorithm. We show that the transition from majority logic decoding to threshold decoding increases the distance realized by the algorithm without affecting the order of complexity. We analyze a version of the algorithm designed for machine implementation which requires $n$ votings, where $n$ is the code length.

UDC: 621.391.15

Received: 10.04.1990
Revised: 22.07.1991

 English version: Problems of Information Transmission, 1991, 27:4, 317–321

Bibliographic databases:

•