LDPC Codes Based on the Space of Symmetric Matrices over Finite Fields
Lists
Only you see this
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 $n\times n$ symmetric matrices over $\mathbb{F}_{q}$. Using this method, we obtain two classes of binary LDPC codes, $\cal{C}(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 $\cal{C}(n,q)$, we determine the minimum distance and the stopping distance for some special cases and obtain the lower bounds for other cases.
BibTeX
@article{zhao2017ldpc,
author = {Meng Zhao and Changli Ma and Qi Wang},
title = {{LDPC Codes Based on the Space of Symmetric Matrices over Finite Fields}},
journal = {IEEE Trans. Information Theory},
year = {2017},
url = {https://openreview.net/forum?id=5ENgtxRwbW},
}| Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding | IEEE Trans. Information Theory · 2004 |
| Constructions of block MDS LDPC codes from punctured circulant matrices | arXiv · 2025 |
| On the Minimal Pseudo-Codewords of Codes from Finite Geometries | ISIT · 2005 |
| Shortened Array Codes of Large Girth | IEEE Trans. Information Theory · 2006 |
| Constructing LDPC Codes by 2-Lifts | arXiv · 2006 |
| Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes | arXiv · 2006 |