A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening

Sam Dolinar. A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening. In Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005. pages 1627-1631, IEEE, 2005. [doi]

Abstract

Abstract is missing.