Incidence Structures From the Blown–Up Plane and LDPC Codes

DOI10.1109/TIT.2011.2146490MaRDI QIDQ5273540zbMATH OpenFDO

Authors Alain Couvreur

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.3774

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence matrices turn out to be redundant, which means that their number of rows exceeds their rank. Such a feature is absent from random LDPC codes and is in general interesting for the efficiency of iterative decoding. The performance of some codes under iterative decoding is tested. Some of them turn out to perform better than regular Gallager codes having similar rate and row weight.

This page was built for publication: Incidence Structures From the Blown–Up Plane and LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273540)