Low-density parity check codes

Journal Papers

2014

Y. Cassuto and A. Shokrollahi
LDPC Codes for 2D Arrays
Ieee Transactions On Information Theory, Vol. 60, Nr. 6, pp. 3279-3291, 2014.
detailed record ] [ full document ] [ bibtex ]

2011

M.H. Taghavi, A. Shokrollahi and P.H. Siegel
Efficient Implementation of Linear Programming Decoding
Ieee Transactions On Information Theory, Vol. 57, pp. 5960-5982, 2011.
detailed record ] [ full document ] [ bibtex ]

2005

M. Rashidpour, A. Shokrollahi and S.H. Jamali
Optimal regular LDPC codes for the binary erasure channel
IEEE Communication Letters, Vol. 9, Nr. 6, pp. 546-548, 2005.
detailed record ] [ full document ] [ bibtex ]

2002

P. Oswald and A. Shokrollahi
Capacity-achieving sequences for the erasure channel
IEEE Transactions on Information Theory, Vol. 48, Nr. 12, pp. 3017 - 3028, 2002.
detailed record ] [ full document ] [ bibtex ]

2001

M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi and D.A. Spielman
Improved low-density parity-check codes using irregular graphs
IEEE Transactions on Information Theory, Vol. 47, Nr. 2, pp. 619-637, 2001.
detailed record ] [ full document ] [ bibtex ]

M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi and D.A. Spielman
Efficient erasure correcting codes
IEEE Transactions on Information Theory, Vol. 47, Nr. 2, pp. 569-584, 2001.
detailed record ] [ full document ] [ bibtex ]

T.J. Richardson, M.A. Shokrollahi and R.L. Urbanke
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory, Vol. 47, Nr. 2, pp. 619-637, 2001.
detailed record ] [ full document ] [ bibtex ]

2000

A. Shokrollahi
Capacity-achieving sequences
IMA volumes in Mathematics and its Applications, Vol. 123, pp. 153-166, 2000.
detailed record ] [ full document ] [ bibtex ]

Conference Papers

Pending

E. Ben-Sasson, G. Maatouk, A. Shpilka and M. Sudan
Symmetric LDPC codes are not necessarily locally testable
2010.
detailed record ] [ full document ] [ bibtex ]

2012

M. Alipour Babaei, S.O. Etesami, G. Maatouk and A. Shokrollahi
Irregular Product Codes
2012 IEEE INFORMATION THEORY WORKSHOP (ITW), pp. 197-201, 2012.
detailed record ] [ full document ] [ bibtex ]

2011

Y. Cassuto and M.A. Shokrollahi
Array-Code Ensembles -or- Two-Dimensional LDPC Codes
2011 IEEE International Symposium On Information Theory Proceedings (ISIT), pp. 518-522, 2011.
detailed record ] [ full document ] [ bibtex ]

2005

A. Brown, M. Luby and A. Shokrollahi
Repeat-accumulate codes that approach the Gilbert-Varshamov bound
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2005, pp. 169-173, 2005.
detailed record ] [ full document ] [ bibtex ]

2004

A. Shokrollahi and W. Wang
Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2004, pp. 275, 2004.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi
Capacity-approaching codes on the q-ary symmetric channel for large q
Proceedings of the IEEE Information Theory Workshop, 2004, pp. 204-208, 2004.
detailed record ] [ full document ] [ bibtex ]

2002

T. Richrdson, A. Shokrollahi and R. Urbanke
Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2002, pp. 1, 2002.
detailed record ] [ full document ] [ bibtex ]

2000

C. Monico, J. Rosenthal and A. Shokrollahi
Using low density parity check codes in the McEliece cryptosystem
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000, pp. 215, 2000.
detailed record ] [ full document ] [ bibtex ]

T. Richardson, A. Shokrollahi and R. Urbanke
Design of provably good low-density parity check codes
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000, pp. 199, 2000.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi and R. Storn
Design of efficient erasure codes with differential evolution
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000, pp. 5, 2000.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi
Codes and Graphs
Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Vol. 1770, pp. 1-12, 2000.
detailed record ] [ full document ] [ bibtex ]

1998

M. Luby, M. Mitzenmacher and A. Shokrollahi
Analysis of random processes via AND/OR tree evaluations
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 364-373, 1998.
detailed record ] [ full document ] [ bibtex ]

M. Luby, M. Mitzenmacher, A. Shokrollahi and D.A. Spielman
Analysis of low-density codes and improved designs using irregular graphs
Proceedings of the 30th annual ACM Symposium on Theory of Computing, STOC 1998, pp. 249-258, 1998.
detailed record ] [ full document ] [ bibtex ]

1997

M. Luby, M. Mitzenmacher, A. Shokrollahi, D.A. Spielman and V. Stemann
Practical loss-resilient codes
Proceedings of the 29th annual ACM Symposium on Theory of Computing, STOC 1997, pp. 150-159, 1997.
detailed record ] [ full document ] [ bibtex ]

Book Chapters

2002

A. Shokrollahi
An Introduction to Low-Density Parity-Check Codes
in Theoretical Aspects of Computer Science : Advanced Lectures,  : Springer, 2002.
detailed record ] [ full document ] [ bibtex ]

Get this list in bibtex format

Patents

2000

A. Shokrollahi, M. Luby, M. Mitzenmacher, D. Spielman and V. Stemann
Message encoding with irregular graphing
2000.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi, M. Luby, V. Stemann, M. Mitzenmacher and D. Spielman
Loss resilient decoding technique
2000.
detailed record ] [ full document ] [ bibtex ]

A. Shokrollahi, M. Luby, V. Stemann, M. Mitzenmacher and D. Spielman
Irregularly graphed encoding technique
2000.
detailed record ] [ full document ] [ bibtex ]

Get this list in bibtex format