Abstract
This paper presents two new methods for constructing quasi-cyclic LDPC codes using certain special classes of balanced incomplete block designs constructed based on finite fields. The codes constructed perform well with iterative decoding over both AWGN and binary erasure channels. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Lan, L., Tai, Y. Y., Lin, S., Memari, B., & Honary, B. (2006). New constructions of quasi-cyclic LDPC codes based on two classes of balanced incomplete block designs: For AWGN and binary erasure channels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 275–284). https://doi.org/10.1007/11617983_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
