Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel
Ohad Barak, David Burshtein, Meir Feder · IEEE Transactions on Information Theory · 2004
We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.