Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$

Mitzenmacher, Michael

doi:10.1109/TIT.2006.885443

Record: found
Abstract: not found
Article: not found

Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$

Author(s): Michael Mitzenmacher

Publication date (Print): December 2006

Journal: IEEE Transactions on Information Theory

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 12

Record: found
Abstract: not found
Article: not found

The capacity of low-density parity-check codes under message-passing decoding

T.J. Richardson, R.L. Urbanke (2001)

0 comments Cited 448 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Efficient erasure correcting codes

M.G. Luby, Michael M. Mitzenmacher, M.A. Shokrollahi … (2001)

0 comments Cited 177 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Efficient encoding of low-density parity-check codes

T.J. Richardson, R.L. Urbanke (2001)

0 comments Cited 95 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Journal ID (publisher-id): IETTAW

Title: IEEE Transactions on Information Theory

Abbreviated Title: IEEE Trans. Inform. Theory

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

ISSN (Print): 0018-9448

Publication date Created: 2006

Publication date (Print): December 2006

Volume: 52

Issue: 12

Pages: 5496-5501

Article

DOI: 10.1109/TIT.2006.885443

SO-VID: a7d54dc2-2c9f-49b6-a78a-0b4ca04895d9

History

Data availability:

Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$

Read this article at

Related collections

ScienceOpen Research

Most cited references 12

The capacity of low-density parity-check codes under message-passing decoding

Efficient erasure correcting codes

Efficient encoding of low-density parity-check codes

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 3,172

Cited by 4

Most referenced authors 35