DocumentCode :
2240868
Title :
Analysis and proof of the stability condition for low-density erasure codes
Author :
Jian-jun, Mu ; Yu-cheng, He ; Xin-mei, Wang
Author_Institution :
Nat. Key Lab of ISN, Xidian Univ., Xi´´an, China
Volume :
2
fYear :
2001
fDate :
2001
Firstpage :
824
Abstract :
Based on the known principle of fixed points in mathematical analysis, a sufficient convergence condition for erasure codes is shown. Moreover, it is pointed out that this general convergence condition is weaker than the convergence condition available. Finally, for erasure codes constructed from bipartite graphs with heavy-tail/Poisson sequences we show a necessary and sufficient condition for the algorithm to finish successfully
Keywords :
Poisson distribution; error correction codes; error detection codes; graph theory; numerical stability; LDPC codes; bipartite graphs; convergence condition; heavy-tail/Poisson sequences; low-density erasure codes; mathematical analysis; stability condition; Algorithm design and analysis; Bipartite graph; Channel capacity; Convergence; Helium; Iterative decoding; Mathematical analysis; Parity check codes; Stability analysis; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
Conference_Location :
Beijing
Print_ISBN :
0-7803-7010-4
Type :
conf
DOI :
10.1109/ICII.2001.983683
Filename :
983683
Link To Document :
بازگشت