Skip to search formSkip to main contentSkip to account menu

Binary erasure channel

Known as: BEC, Erasure channel 
A binary erasure channel (or BEC) is a common communications channel model used in coding theory and information theory. In this model, a transmitter… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are… 
2009
2009
A possibility of estimating the finite-length performance of sparse-graph code ensembles gives two opportunities: to compare… 
Highly Cited
2008
Highly Cited
2008
Fountain codes are designed for erasure channels, and are particularly well suited for broadcast applications from a single… 
Highly Cited
2006
Highly Cited
2006
We study the average error probability performance of binary linear code ensembles when each codeword is divided into J… 
Highly Cited
2006
Highly Cited
2006
Fountain coding principle introduced by Byers et al. in 1998 describes an efficient way to transfer information over erasure… 
Highly Cited
2005
Highly Cited
2005
Recently there has been interest in the construction of small parity-check sets for iterative decoding of the Hamming code with… 
Highly Cited
1999
Highly Cited
1999
We present an algorithm that assigns unequal amounts of forward error correction to progressive data so as to provide graceful… 
Highly Cited
1998
Highly Cited
1998
In this paper, we present an efficient Multiple Description Coding (MDC) technique to achieve robust communication over… 
Highly Cited
1984
Highly Cited
1984
A direct-detection photon-limited optical communication channel that uses pulse position modulation (PPM) under a pulsewidth… 
Highly Cited
1979
Highly Cited
1979
Consider the case where an n -digit block encoded word cannot be decoded reliably and a second block of n redundant digits is…