Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,976,374 papers from all fields of science
Search
Sign In
Create Free Account
Decoding methods
Known as:
Mimimum distance decoding
, Minimum distance decoding
, Ideal observer decoding
Expand
In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Berlekamp–Massey algorithm
Berlekamp–Welch algorithm
Binary code
Binary symmetric channel
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Distributed Space-Time Codes for Cooperative Networks with Partial CSI
Xiao-Hong Peng
IEEE Wireless Communications and Networking…
2007
Corpus ID: 2588444
Design criteria and full-diversity distributed space time codes (DSTCs) for the two phase transmission based cooperative…
Expand
2006
2006
A Non-orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria
G. Rajan
,
B. Rajan
IEEE Information Theory Workshop - ITW '06…
2006
Corpus ID: 595
In this- two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several…
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
1998
1998
Efficient maximum-likelihood decoding of Q-ary modulated Reed-Muller codes
A. Grant
,
R. V. Nee
IEEE Communications Letters
1998
Corpus ID: 16734483
We derive an efficient soft-decision maximum-likelihood decoding algorithm for a class of Q-ary phase-shift keyed peak-to-average…
Expand
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
M. Gertsman
,
J. Lodge
IEEE Transactions on Communications
1997
Corpus ID: 15892320
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived…
Expand
1997
1997
New Iterative ("Turbo") Decoding Algorithms.
P. Höher
1997
Corpus ID: 7658387
Decoding with feedback or iterative decoding is an eecient, low-complexity means for \informa-tion handover" in any parallel or…
Expand
Highly Cited
1995
Highly Cited
1995
Maximum likelihood decoding of uncoded and coded PSK signal sequences transmitted over Rayleigh flat-fading channels
G. Vitetta
,
Desmond P. Taylor
IEEE Transactions on Communications
1995
Corpus ID: 39152586
The problem of maximum likelihood (ML) detection for uncoded and coded M-PSK signals on Rayleigh fading channels is investigated…
Expand
Highly Cited
1994
Highly Cited
1994
User-separating demodulation for code-division multiple-access systems
M. Rupf
,
Felix Tarköy
,
J. Massey
IEEE J. Sel. Areas Commun.
1994
Corpus ID: 36811147
A user-separating (US) demodulator for a multiple-access system with digital transmission is defined to be a demodulator that…
Expand
Highly Cited
1974
Highly Cited
1974
A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding
L. Meeberg
IEEE Transactions on Information Theory
1974
Corpus ID: 42306002
Tighter upper bounds on the error event and the bit error probabilities, respectively, for maximum-likelihood decoding of binary…
Expand
1971
1971
Decoding beyond the BCH bound
C. Hartmann
1971
Corpus ID: 206731169
Abstraci-In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum…
Expand