Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,400,089 papers from all fields of science
Search
Sign In
Create Free Account
Error floor
The error floor is a phenomenon encountered in modern iterated sparse graph-based error correcting codes like LDPC codes and turbo codes. When the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Concatenated error correction code
Convolutional code
DVB-S2
Low-density parity-check code
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Real-Time 2.5 GS/s Coherent Optical Receiver for 53.3-Gb/s Sub-Banded OFDM
N. Kaneda
,
Qi Yang
,
Xiang Liu
,
S. Chandrasekhar
,
W. Shieh
,
Young-Kai Chen
Journal of Lightwave Technology
2010
Corpus ID: 26826840
A real-time receiver for the coherent optical orthogonal frequency-division multiplexing (CO-OFDM) detection is realized in a…
Expand
Highly Cited
2008
Highly Cited
2008
Two channel estimation methods for amplify-and-forward relay networks
Berna Gedik
,
Murat Uysal
Canadian Conference on Electrical and Computer…
2008
Corpus ID: 17826272
In this paper, we investigate the performance of amplify-and-forward relaying with two different pilot-symbol-assisted channel…
Expand
Highly Cited
2006
Highly Cited
2006
Adaptive MAP receiver via the EM algorithm and message passings for MIMO-OFDM mobile communications
T. Kashima
,
K. Fukawa
,
H. Suzuki
IEEE Journal on Selected Areas in Communications
2006
Corpus ID: 14194361
This paper proposes two new types of maximum a posteriori probability (MAP) receivers for multiple-input-multiple-output and…
Expand
2006
2006
Performance of turbo equalizers for optical PMD channels
M. Jager
,
T. Rankl
,
J. Speidel
,
H. Bulow
,
F. Buchali
Journal of Lightwave Technology
2006
Corpus ID: 25303832
This paper investigates the performance of iterative (turbo) equalization to mitigate the effects of a polarization-mode…
Expand
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
Lei Chen
,
Jun Xu
,
I. Djurdjevic
,
Shu Lin
IEEE Transactions on Communications
2004
Corpus ID: 45108712
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
Highly Cited
2004
Highly Cited
2004
Spectral phase-encoded time-spreading (SPECTS) optical code-division multiple access for terabit optical access networks
V. Hernandez
,
Yixue Du
,
+6 authors
S. Yoo
Journal of Lightwave Technology
2004
Corpus ID: 2653491
This paper discusses design, simulation, and experimental investigations of optical-code-division multiple-access (O-CDMA…
Expand
Highly Cited
2003
Highly Cited
2003
Low-density parity check codes and iterative decoding for long-haul optical communication systems
B. Vasic
,
I. Djordjevic
,
R. Kostuk
2003
Corpus ID: 10881499
A forward-error correction (FEC) scheme based on low-density parity check (LDPC) codes and iterative decoding using belief…
Expand
2002
2002
On Architecture and Limitation of Optical Multiprotocol Label Switching (MPLS) Networks Using Optical-Orthogonal-Code (OOC)/Wavelength Label
Y. Wen
,
Ya-Ping Zhang
,
L. Chen
Optical fiber technology (Print)
2002
Corpus ID: 4242668
Abstract To accommodate the explosive packet-based data traffic in WDM networks, intelligent optical routing and switching are…
Expand
2001
2001
On error floor and free distance of turbo codes
R. Garello
,
F. Chiaraluce
,
P. Pierleoni
,
Marco Scaloni
,
S. Benedetto
ICC . IEEE International Conference on…
2001
Corpus ID: 13712573
Turbo codes have excellent performance at low and medium signal-to-noise ratios (SNR) very close to the Shannon limit, and are at…
Expand
Highly Cited
2000
Highly Cited
2000
Low density parity check codes for magnetic recording channels
Hongxin Song
,
R. Todd
,
J. R. Cruz
2000
Corpus ID: 17144277
We propose a system for magnetic recording, using a low density parity check (LDPC) code as the error-correcting-code, in…
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