Computer Science – Information Theory
Scientific paper
2009-01-26
Computer Science
Information Theory
To appear in IEEE Transactions on Information Theory. Changes compared to v1: some convolutional code results have been added;
Scientific paper
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection between QC codes and convolutional codes, we can state similar results for the free Hamming distance of convolutional codes. In fact, some QC code statements are established by first proving the corresponding convolutional code statements and then using a result by Tanner that says that the minimum Hamming distance of a QC code is upper bounded by the free Hamming distance of the convolutional code that is obtained by "unwrapping" the QC code.
Smarandache Roxana
Vontobel Pascal O.
No associations
LandOfFree
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-361203