Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
constituent codes
Description:
Component error-correcting codes combined to form larger codes, including polar and turbo codes in coding theory.
Primary topic:
Error Correcting Code Techniques (73%)
Related topics:
Error Correcting Code Techniques (73%),
Coding theory and cryptography (19%)
OpenAlex ID:
keywords/constituent-codes
Convergence behavior of iteratively decoded parallel concatenated codes
2001
·
S. ten Brink
·
IEEE Transactions on Communications
·
2,565
A search for good convolutional codes to be used in the construction of turbo codes
1998
·
S. Benedetto
, R. Garello
, et al.
·
IEEE Transactions on Communications
·
183
On the design of turbo codes
1995
·
D. Divsalar
, F. Pollara
·
171
Multiple turbo codes
2002
·
D. Divsalar
, F. Pollara
·
IEEE Military Communications Conference (MILCOM)
·
100
Fast Simplified Successive-Cancellation List Decoding of Polar Codes
2017
·
Seyyed Ali Hashemi
, Carlo Condo
, et al.
·
IEEE Wireless Communications and Networking Conference Workshops (WCNCW)
·
97
Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers
2005
·
Stewart Crozier
, Paul Guinand
·
Annals of Telecommunications
·
77
Fast Low-Complexity Decoders for Low-Rate Polar Codes
2016
·
Pascal Giard
, Alexios Balatsoukas-Stimming
, et al.
·
Journal of Signal Processing Systems
·
59
PDF
XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes
2015
·
Jingwei Xu
, Tiben Che
, et al.
·
Globecom
·
48
Fast Decoding of Polar Codes for Digital Broadcasting Services in 5G
2024
·
He Sun
, Emanuele Viterbo
, et al.
·
IEEE Transactions on Broadcasting
·
47
Improved Algorithms for the Determination of Turbo-Code Weight Distributions
2005
·
E. Rosnes
, O. Ytrehus
·
IEEE Transactions on Communications
·
44
Convergence of multidimensional iterative decoding schemes
2001
·
S. ten Brink
·
Asilomar Conference on Signals, Systems and Computers (ACSSC)
·
44
Zipper Codes: Spatially-Coupled Product-Like Codes with Iterative Algebraic Decoding
2019
·
Alvin Y. Sukmadji
, Umberto Martinez-Penas
, et al.
·
Canadian Workshop on Information Theory (CWIT)
·
40
A New Upper Bound on the Minimum Distance of Turbo Codes
2004
·
A. Perotti
, S. Benedetto
·
IEEE Transactions on Information Theory
·
30
An Introduction to Tensor Product Codes and Applications to Digital Storage Systems
2006
·
Jack Keil Wolf
·
IEEE Information Theory Workshop (ITW)
·
29
New low-complexity turbo-like codes
2002
·
P.C. Massey
, D.J. Costello
·
IEEE Information Theory Workshop (ITW)
·
27
A Bound on the Minimum Distance of Quasi-cyclic Codes
2012
·
Cem Güneri̇
, Ferruh Özbudak
·
SIAM Journal on Discrete Mathematics
·
26
Turbo codes with recursive nonsystematic quick-look-in constituent codes
2002
·
P.C. Massey
, D.J. Costello
·
IEEE International Symposium on Information Theory (ISIT)
·
23
Improving the constituent codes of turbo encoders
2002
·
M.S.C. Ho
, S.S. Pietrobon
, et al.
·
Globecom
·
21
Evidence for processing of constituent singleand multiletter codes: Support for multilevel coding in word perception
1988
·
Seth N. Greenberg
, Frank R. Vellutino
·
Memory & Cognition
·
20
The iterative turbo decoding algorithm has fixed points
2001
·
L. Duan
, B. Rimoldi
·
IEEE Transactions on Information Theory
·
19
Role of recursive convolutional codes in turbocodes
1995
·
S. Benedetto
, G. Montorsi
·
Electronics Letters
·
18
Construction of new quantum codes via Hermitian dual-containing matrix-product codes
2020
·
Meng Cao
, Jianlian Cui
·
Quantum Information Processing
·
17
Improved algorithms for high rate turbo code weight distribution calculation
2003
·
E. Rosnes
, O. Ytrehus
·
16
XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes
2014
·
Jingwei Xu
, Tiben Che
, et al.
·
Globecom
·
14
Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes
2007
·
Irina E. Bocharova
, Boris D. Kudryashov
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
14
Show more works
View as search
Works count:
114
Citation count:
4,001
Year
Topic
Type