This article is cited in 12 papers

Coding Theory

Graph-based convolutional and block LDPC codes

I. E. Bocharova, B. D. Kudryashov, R. V. Satyukov

St. Petersburg State University of Information Technologies, Mechanics and Optics

Abstract: We consider regular block and convolutional LDPC codes determined by paritycheck matrices with rows of a fixed weight and columns of weight 2. Such codes can be described by graphs, and the minimum distance of a code coincides with the girth of the corresponding graph. We consider a description of such codes in the form of tail-biting convolutional codes. Long codes are constructed from short ones using the “voltage graph” method. On this way we construct new codes, find a compact description for many known optimal codes, and thus simplify the coding for such codes. We obtain an asymptotic lower bound on the girth of the corresponding graphs. We also present tables of codes.

UDC: 621.391.15

Received: 09.06.2009
Revised: 14.09.2009

 English version: Problems of Information Transmission, 2009, 45:4, 357–377

Bibliographic databases:

• 
• 
• 
•