Skip to search formSkip to main contentSkip to account menu

Decoding methods

Known as: Mimimum distance decoding, Minimum distance decoding, Ideal observer decoding 
In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
Berlekamp–Massey algorithmBerlekamp–Welch algorithmBinary codeBinary symmetric channel

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
ML Decoder for Decode-and-Forward Based Cooperative Communication System
Decode-and-forward (DF) protocol based cooperative communication is vulnerable to the erroneous relaying by the relay. In this… 
2009
2009
High-rate full-diversity space-time block codes for three and four transmit antennas
The authors deal with the design of high-rate, full-diversity, low-maximum likelihood (ML) decoding complexity space-time block… 
Highly Cited
2007
Highly Cited
2007
A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding
A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant… 
Highly Cited
2005
Highly Cited
2005
On Blind Compression of Encrypted Correlated Data Approaching The Source Entropy Rate
Traditional data transmission over an insecure noiseless channel consists of first compressing data for efficiency and then… 
Highly Cited
2004
Highly Cited
2004
A VLSI architecture of the Schnorr-Euchner decoder for MIMO systems
The lattice decoder is shown to approach the performance of maximum-likelihood decoder for MIMO wireless systems with low… 
Highly Cited
1999
Highly Cited
1999
Performance bounds for turbo-coded modulation systems
We apply the standard union bound to turbo-coded modulation systems with maximum-likelihood decoding. To illustrate the… 
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived… 
Highly Cited
1995
Highly Cited
1995
Maximum likelihood decoding of uncoded and coded PSK signal sequences transmitted over Rayleigh flat-fading channels
The problem of maximum likelihood (ML) detection for uncoded and coded M-PSK signals on Rayleigh fading channels is investigated… 
Highly Cited
1979
Highly Cited
1979
Improvements in Block-Retransmission Schemes
Consider the case where an n -digit block encoded word cannot be decoded reliably and a second block of n redundant digits is… 
Highly Cited
1974
Highly Cited
1974
A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding
Tighter upper bounds on the error event and the bit error probabilities, respectively, for maximum-likelihood decoding of binary… 
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)