On the stopping distance of LDPC codes based on symplectic space over finite fields

You Gao, Yun-Fei Yao and He Ma

Applied Mathematics and Computation, 2021, vol. 391, issue C

Abstract: By using the important concept of stoping distance of the LDPC codes, how to perform about the iterative decoding of the LDPC codes in binary erasure channels is analyzed. In this article, we introduce a class of LDPC codes designed on the premise of the symplectic space over finite fields. An important parameter of stopping distance is estimated mainly and the lower bound on the stopping distance of the code designed on the premise of symplectic space is acquired.

Keywords: Stopping distance; Stopping sets; LDPC codes; Symplectic space (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320305798
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:391:y:2021:i:c:s0096300320305798

DOI: 10.1016/j.amc.2020.125625

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().