Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel - researchr publication related

researchr

You are not signed in
Sign in
Sign up

A. Makhdoumi Kakhaki, H. Karkeh Abadi, Pedram Pad, Hamid Saeedi, Farokh Marvasti, Kasra Alishahi. Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel. In Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012. pages 621-625, IEEE, 2012. [doi]

The following publications are possibly variants of this publication:

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure ChannelHamid Saeedi, Amir H. Banihashemi. TIT, 56(12):6332-6346, 2010. [doi]

New sequences of capacity achieving LDPC code ensembles over the binary erasure channelHamid Saeedi, Amir H. Banihashemi. isit 2008: 797-801 [doi]

runs on WebDSL