Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,326,149 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Arbitrarily varying channel
Binary symmetric channel
Block code
Channel (communications)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Improving performance of multithreshold decoder over binary erasure channel
N. N. Grinchenko
,
A. Gromov
,
O. Ovechkin
Mediterranean Conference on Embedded Computing
2017
Corpus ID: 23481341
The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are…
Expand
2009
2009
Finite-length scaling of turbo-like code ensembles on the binary erasure channel
I. Andriyanova
IEEE Journal on Selected Areas in Communications
2009
Corpus ID: 6006625
A possibility of estimating the finite-length performance of sparse-graph code ensembles gives two opportunities: to compare…
Expand
Highly Cited
2008
Highly Cited
2008
Relaying a fountain code across multiple nodes
R. Gummadi
,
R. Sreenivas
IEEE Information Theory Workshop
2008
Corpus ID: 15303933
Fountain codes are designed for erasure channels, and are particularly well suited for broadcast applications from a single…
Expand
Highly Cited
2006
Highly Cited
2006
Reliable channel regions for good binary codes transmitted over parallel channels
Ruoheng Liu
,
P. Spasojevic
,
E. Soljanin
IEEE Transactions on Information Theory
2006
Corpus ID: 18331520
We study the average error probability performance of binary linear code ensembles when each codeword is divided into J…
Expand
Highly Cited
2006
Highly Cited
2006
Optimizing the Degree Distribution of LT codes with an Importance Sampling Approach
Esa Hyytiä
,
T. Tirronen
,
J. Virtamo
2006
Corpus ID: 10940506
Fountain coding principle introduced by Byers et al. in 1998 describes an efficient way to transfer information over erasure…
Expand
Highly Cited
2005
Highly Cited
2005
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
H. Hollmann
,
L. Tolhuizen
IEEE Transactions on Information Theory
2005
Corpus ID: 13983927
Recently there has been interest in the construction of small parity-check sets for iterative decoding of the Hamming code with…
Expand
Highly Cited
1999
Highly Cited
1999
Graceful degradation over packet erasure channels through forward error correction
A. Mohr
,
E. Riskin
,
Richard E. Ladner
Proceedings DCC'99 Data Compression Conference…
1999
Corpus ID: 14861410
We present an algorithm that assigns unequal amounts of forward error correction to progressive data so as to provide graceful…
Expand
Highly Cited
1998
Highly Cited
1998
Multiple description coding via polyphase transform and selective quantization
Wenqing Jiang
,
Antonio Ortega
Electronic imaging
1998
Corpus ID: 62770435
In this paper, we present an efficient Multiple Description Coding (MDC) technique to achieve robust communication over…
Expand
Highly Cited
1984
Highly Cited
1984
Information rates of photon-limited overlapping pulse position modulation channels
I. Bar-David
,
G. Kaplan
IEEE Transactions on Information Theory
1984
Corpus ID: 44838901
A direct-detection photon-limited optical communication channel that uses pulse position modulation (PPM) under a pulsewidth…
Expand
Highly Cited
1979
Highly Cited
1979
Improvements in Block-Retransmission Schemes
J. Metzner
IEEE Transactions on Communications
1979
Corpus ID: 62674507
Consider the case where an n -digit block encoded word cannot be decoded reliably and a second block of n redundant digits is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE