Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes

We consider an ensemble of random q -ary LDPC codes. As constituent codes, we use q -ary single-parity-check codes with d = 2 and Reed-Solomon codes with d = 3. We propose a hard-decision iterative decoding algorithm with the number of iterations of the order of the logarithm of the code length. We...

Celý popis

Podrobná bibliografia

Vydané v:	Problems of information transmission Ročník 46; číslo 2; s. 142 - 159
Hlavní autori:	Frolov, A. A., Zyablov, V. V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht SP MAIK Nauka/Interperiodica 01.06.2010
Predmet:	Coding Theory Communications Engineering Control Electrical Engineering Engineering Information Storage and Retrieval Networks Systems Theory Information Transmission LDPC Code Asymptotic Estimation Code Length Code Rate
ISSN:	0032-9460, 1608-3253
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!