Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,215,523 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
G. Rajan
,
B. Rajan
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
2005
2005
Information theoretical versus algebraic constructions of linear unitary precoders for non-ergodic multiple antenna channels
Ghassan M. Kraidy
,
N. Gresset
,
J. Boutros
2005
Corpus ID: 15062328
In this paper, we propose a new construction of linear unitary precoders for multiple antenna fading channels based on an…
Expand
2003
2003
On the design and maximum-likelihood decoding of space-time trellis codes
D. Aktas
,
H. El Gamal
,
M. Fitz
IEEE Transactions on Communications
2003
Corpus ID: 2013338
In this letter, we present a simple generalization of the maximum ratio combining principle for space-time coded systems. This…
Expand
2001
2001
Performance of space-time bit-interleaved codes in fading channels with simplified iterative decoding
Andrea M. Tonello
IEEE VTS 53rd Vehicular Technology Conference…
2001
Corpus ID: 11331752
The performance of space-time bit-interleaved codes over block fading channels is considered. Decoding is based on iterative…
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
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
1983
1983
Decoding by local optimization
K. Farrell
,
L. Rudolph
,
C. Hartmann
,
L. D. Nielsen
IEEE Transactions on Information Theory
1983
Corpus ID: 7181605
The maximum likelihood decoding problem for linear binary (n,k) codes is reformulated as a continuous optimization problem in a k…
Expand
1980
1980
Generalized minimum distance decoding algorithms for Q ary output channels (Corresp.)
C. Yu
,
D. Costello
IEEE Transactions on Information Theory
1980
Corpus ID: 11328300
A new condition for a generalized minimum distance decoder to guarantee correct decoding is developed. Based on this condition…
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