Predicting error performance of randomly shortened and punctured LDPC codes
22 February 2019
In this contribution we point out that the error performance of randomly shortened and punctured low density parity check (LDPC) codes on a time-invariant memoryless channel can be accurately determined from the error performance of the mother code on the considered channel. We show that the gap to capacity of the daughter code grows with increasing shortening and puncturing fractions. Our theoretical results are confirmed by simulations for practical codes on both the binary erasure channel (BEC) and the binary-input additive white gaussian noise channel (BI-AWGNC).
