LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields

DOI10.1109/TIT.2017.2685501zbMATH Open1370.94576arXiv1605.07273OpenAlexW2964307412MaRDI QIDQ5358574

Qi Wang, Changli Ma, Meng Zhao

Publication date: 21 September 2017

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

Abstract: In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $mathbb{S}_n(mathbb{F}_q)$, the space of $nimesn$ symmetric matrices over $mathbb{F}_q$. Using this method, we obtain two classes of binary LDPC codes, $calC(n,q)$ and $cal{C}^T(n,q)$, both of which have grith $8$. Then both the minimum distance and the stopping distance of each class are investigated. It is shown that the minimum distance and the stopping distance of $cal{C}^T(n,q)$ are both $2q$. As for $calC(n,q)$, we determine the minimum distance and the stopping distance for some special cases and obtain the lower bounds for other cases.

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (4)

The construction of LDPC codes based on the subspaces of singular linear space over finite field ⋮ Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ LDPC Block and Convolutional Codes Based on Circulant Matrices ⋮ Title not available (Why is that?)

This page was built for publication: LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields

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