The problem of the LDPC-codes constructing on the base of Euclidean geometries
Abstract
In this paper we consider the low-density parity-check codes based on final Euclidean geometries. For the number of such codes the estimations of their minimal distance and spectrum are obtained. The shortening procedures and the estimations of codes distance are suggested. The simulation results in channel with AWGN are presented.
Published
2005-02-21
How to Cite
Ovchinnikov, A. (2005). The problem of the LDPC-codes constructing on the base of Euclidean geometries. Information and Control Systems, (1), 32-40. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14505
Issue
Section
Information coding and transmission