How Sparse Can Parity-Check Matrices of Binary Linear Codes Be, as a Function of Their Gap to Capacity?

Sason, Igal; Urbanke, Rüdiger

Permalink

https://hdl.handle.net/2142/131484 Copy

Description

Title

How Sparse Can Parity-Check Matrices of Binary Linear Codes Be, as a Function of Their Gap to Capacity?

Author(s)

• Sason, Igal
• Urbanke, Rüdiger

Issue Date

2002-10-02

Keyword(s)

• Coding
• LDPC codes

Publisher

Allerton Conference on Communication, Control, and Computing

Series/Report Name or Number

2002 40th Allerton Conference on Communication, Control, and Computing Proceedings

ISSN

2836-4503

Type of Resource

Text

Genre of Resource

• Conference Paper
• Presentation

Language

eng

Handle URL

https://hdl.handle.net/2142/131484

Copyright and License Information

Copyright 2002 owned by the author(s).

Owning Collections