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...

Cijeli opis

Bibliografski detalji

Glavni autori:	Pavel Rybin, Kirill Andreev, Victor Zyablov
Format:	Artigo
Jezik:	Inglês
Izdano:	MDPI AG 2021-02-01
Serija:	Entropy
Teme:	low-density parity check (LDPC) codes Gallager’s LDPC codes binary LDPC codes decoding algorithm low-complexity error exponent
Online pristup:	https://www.mdpi.com/1099-4300/23/2/253
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!