DocumentCode :
2648549
Title :
On upper bounds for the achievable rates of LDPC codes
Author :
Presman, Noam ; Litsyn, Simon
Author_Institution :
Sch. of Electr. Eng., Tel Aviv Univ., Ramat Aviv, Israel
fYear :
2009
fDate :
11-16 Oct. 2009
Firstpage :
21
Lastpage :
25
Abstract :
Upper bounds on the mutual entropy of syndrome components of low-density parity-check (LDPC) codes are developed. Using these bounds, an upper bound is derived on the rates of LDPC codes for which reliable communication over a memoryless binary-input symmetric-output (MBIOS) channel is achievable. This bound improves on the earlier known bounds due to Gallager, Burshtein et al., and Weichmann-Sason.
Keywords :
entropy; parity check codes; LDPC codes; low-density parity-check; memoryless binary-input symmetric-output channel; mutual entropy; upper bounds; Block codes; Channel capacity; Conferences; Decoding; Entropy; Error probability; Hydrogen; Information theory; Parity check codes; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2009. ITW 2009. IEEE
Conference_Location :
Taormina
Print_ISBN :
978-1-4244-4982-8
Electronic_ISBN :
978-1-4244-4983-5
Type :
conf
DOI :
10.1109/ITW.2009.5351232
Filename :
5351232
Link To Document :
بازگشت