Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,834,029 papers from all fields of science
Search
Sign In
Create Free Account
Concatenated error correction code
Known as:
Concatenated coding
, Concatenated error correction codes
, Concatenated code
Expand
In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Block code
Channel capacity
Code rate
Coding theory
Expand
Broader (2)
Error detection and correction
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
System architecture and cross-layer optimization of video broadcast over WiMAX
Jianfeng Wang
,
M. Venkatachalam
,
Yuguang Fang
IEEE Journal on Selected Areas in Communications
2007
Corpus ID: 9747208
Video broadcast and mobile TV have received significant interests from both academia and industry recently. The emerging mobile…
Expand
Highly Cited
2005
Highly Cited
2005
Design of multi-input multi-output systems based on low-density Parity-check codes
J. Hou
,
P. Siegel
,
L. Milstein
IEEE Transactions on Communications
2005
Corpus ID: 17797401
We design serial concatenated multi-input multi-output systems based on low-density parity-check (LDPC) codes. We employ a…
Expand
Highly Cited
2004
Highly Cited
2004
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity
Jing Li
,
K. Narayanan
,
C. Georghiades
IEEE Transactions on Information Theory
2004
Corpus ID: 18739074
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product…
Expand
Highly Cited
2001
Highly Cited
2001
Extrinsic information in iterative decoding: a unified view
G. Colavolpe
,
G. Ferrari
,
R. Raheli
IEEE Transactions on Communications
2001
Corpus ID: 8516679
We address the use of the extrinsic information generated by each component decoder in an iterative decoding process. The BJCR…
Expand
Highly Cited
1998
Highly Cited
1998
Performance Evaluation of Superorthogonal Turbo Codes in AWGN and Flat Rayleigh Fading Channels
P. Komulainen
,
K. Pehkonen
IEEE J. Sel. Areas Commun.
1998
Corpus ID: 31423701
Turbo codes are parallel concatenated codes whose performance in the additive white Gaussian noise (AWGN) channel has been shown…
Expand
Highly Cited
1996
Highly Cited
1996
ITERATIVE DECODING OF TURBO CODES AND OTHER CONCATENATED CODES
S. A. Barbulescu
1996
Corpus ID: 16452213
Highly Cited
1996
Highly Cited
1996
Channel access and interference issues in multi-code DS-CDMA wireless packet (ATM) networks
Zhao Liu
,
M. Karol
,
M. Zarki
,
K. Eng
Wirel. Networks
1996
Corpus ID: 29449824
Multi-Code Direct-Sequence Code-Division-Multiple-Access (MC-CDMA) has been proposed as a flexible multiple access scheme for…
Expand
Highly Cited
1996
Highly Cited
1996
Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes
S. Benedetto
,
D. Divsalar
,
G. Montorsi
,
F. Pollara
International Conference on Communications
1996
Corpus ID: 17686326
We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes…
Expand
Highly Cited
1987
Highly Cited
1987
Cellular Efficiency with Slow Frequency Hopping: Analysis of the Digital SFH900 Mobile System
J. Dornstetter
,
D. Verhulst
IEEE J. Sel. Areas Commun.
1987
Corpus ID: 29826252
The new digital cellular SFH900 mobile system, based on "mixed" slow frequency hopping (SFH) combined with time division, is…
Expand
1986
1986
A Concatenated Coding Scheme for Error Control
T. Kasami
,
T. Fujiwara
,
Shu Lin
IEEE Transactions on Communications
1986
Corpus ID: 206637830
In this paper, a concatenated coding scheme for error control in data communications is presented and analyzed. In this scheme…
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