Error Exponents of LDPC Codes under Low-Complexity Decoding

This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity de...

Descripción completa

Detalles Bibliográficos
Autores principales: Rybin, Pavel, Andreev, Kirill, Zyablov, Victor
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7926880/
https://www.ncbi.nlm.nih.gov/pubmed/33671792
http://dx.doi.org/10.3390/e23020253

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7926880/
https://www.ncbi.nlm.nih.gov/pubmed/33671792
http://dx.doi.org/10.3390/e23020253

Ejemplares similares