Author:
Velasquez Alvaro,Subramani K.,Drager Steven L.
Publisher
Springer International Publishing
Reference22 articles.
1. Richardson, T.: Error floors of LDPC codes. In: Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 41, pp. 1426–1435. The University; 1998 (2003)
2. Xiao, H., Banihashemi, A.H.: Estimation of bit and frame error rates of finite-length low-density parity-check codes on binary symmetric channels. IEEE Trans. Commun. 55(12), 2234–2239 (2007)
3. Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory 48(6), 1570–1579 (2002)
4. Krishnan, K.M., Shankar, P.: On the complexity of finding stopping set size in tanner graphs. In: 40th Annual Conference on Information Sciences and Systems, pp. 157–158 (2006)
5. Hu, X.-Y., Eleftheriou, E.: A probabilistic subspace approach to the minimal stopping set problem. In: 2006 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), pp. 1–6. VDE (2006)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献