ScholarLens Back to search
2002•Unpublished venueRequires access

On the complexity of reliable communication on the erasure channel

Aamod Khandekar, Robert J. McEliece

Open publisher page 52 citations

Abstract

We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels.

About this research paper

What this paper is about

We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels.

Why it matters

OpenAlex reports 52 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels.

Key concepts: Binary erasure channel, Erasure, Computer science, Channel (broadcasting), Communication complexity, Erasure code, Theoretical computer science, Binary number

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the complexity of reliable communication on the erasure channel — Research Paper | ScholarLens