К вопросу о построении LDPC-кодов на основе Евклидовых геометрий
Овчинников Андрей Анатольевич · Информационно-управляющие системы · 2005
In this paper we consider the low-density parity-check codes based on finite 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 distance for such codes are suggested. The simulation results in channel with AWGN are presented.