Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
low-rate codes
Description:
Error-correcting codes with a low information rate, meaning they encode relatively few information bits per transmitted symbol.
Primary topic:
Error Correcting Code Techniques (58%)
Related topics:
Error Correcting Code Techniques (58%),
Coding theory and cryptography (26%),
Advanced Wireless Communication Techniques (7%)
OpenAlex ID:
keywords/low-rate-codes
Design, analysis, and performance evaluation for BICM-ID with square QAM constellations in Rayleigh fading channels
2001
·
A. Chindapol
, J.A. Ritcey
·
IEEE Journal on Selected Areas in Communications
·
403
A class of low-rate nonlinear binary codes
1972
·
A.M. Kerdock
·
Information and Control
·
205
The Weight Spectra of Some Short Low-Rate Convolutional Codes
1984
·
J. Conan
·
IRE Transactions on Communications Systems
·
178
IDMA vs. CDMA: Analysis and Comparison of Two Multiple Access Schemes
2011
·
Katsutoshi Kusume
, Gerhard Bauch
, et al.
·
IEEE Transactions on Wireless Communications
·
139
Turbo Codes for Deep-Space Communications
1994
·
D. Divsalar
, F. Pollara
·
NASA Technical Reports Server (NASA)
·
132
Low-rate turbo-Hadamard codes
2003
·
Li Ping
, W.K. Leung
, et al.
·
IEEE Transactions on Information Theory
·
125
Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
2004
·
I. Dumer
·
IEEE Transactions on Information Theory
·
119
PDF
The random coding bound is tight for the average code (Corresp.)
1973
·
R. Gallager
·
IEEE Transactions on Information Theory
·
110
Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
2007
·
Guosen Yue
, Li Ping
, et al.
·
IEEE Transactions on Information Theory
·
94
On interleave-division multiple-access
2004
·
Li Ping
, Lihai Liu
, et al.
·
International Conference on Communications
·
88
Approaching the Capacity of Multiple Access Channels Using Interleaved Low-Rate Codes
2004
·
L. Ping
, L. Liu
, et al.
·
IEEE Communications Letters
·
83
The random coding bound is tight for the average code.
1973
·
Robert G. Gallager
·
IEEE Transactions on Information Theory
·
79
Improved successive cancellation flip decoding of polar codes based on error distribution
2018
·
Carlo Condo
, Furkan Ercan
, et al.
·
IEEE Wireless Communications and Networking Conference Workshops (WCNCW)
·
71
PDF
Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
2010
·
Georg Schmidt
, Vladimir R. Sidorenko
, et al.
·
IEEE Transactions on Information Theory
·
67
PDF
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
2010
·
E. Ben-Sasson
, S. Kopparty
, et al.
·
IEEE Transactions on Information Theory
·
63
On decoding of Reed-Solomon codes
1971
·
D. Mandelbaum
·
IEEE Transactions on Information Theory
·
51
Multiplicatively Repeated Nonbinary LDPC Codes
2011
·
Kenta Kasai
, David Declercq
, et al.
·
IEEE Transactions on Information Theory
·
49
PDF
Three Design Aspects of Multicarrier Interleave Division Multiple Access
2008
·
Rong Zhang
, L. Hanzo
·
IEEE Transactions on Vehicular Technology
·
48
Code-spread CDMA with interference cancellation
1999
·
P.K. Frenger
, P. Orten
, et al.
·
IEEE Journal on Selected Areas in Communications
·
46
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
1993
·
B.-Z. Shen
·
IEEE Transactions on Information Theory
·
46
New Short Constraint Length, Rate 1/N Convolutional Codes Which Minimize the Required SNR for Given Desired Bit Error Rates
1985
·
Pil Lee
·
IEEE Transactions on Communications
·
44
On Sequential Decoding Metric Function of Polarization-Adjusted Convolutional (PAC) Codes
2021
·
Mohsen Moradi
·
IEEE Transactions on Communications
·
43
PDF
On turbo encodedBicm
1999
·
Ilan Abramovici
, Shlomo Shamai
·
Annals of Telecommunications
·
40
Decoding Reed¿Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis
2006
·
Georg Schmidt
, Vladimir Sidorenko
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
37
Efficiently Decoding Reed–Muller Codes From Random Errors
2017
·
Ramprasad Saptharishi
, Amir Shpilka
, et al.
·
IEEE Transactions on Information Theory
·
36
PDF
Show more works
View as search
Works count:
325
Citation count:
4,085
Year
Topic
Type