Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,389,629 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.
Highly Cited
2013
Highly Cited
2013
Noncoherent Trellis Coded Quantization: A Practical Limited Feedback Technique for Massive MIMO Systems
Junil Choi
,
Zachary Chance
,
D. Love
,
Upamanyu Madhow
IEEE Transactions on Communications
2013
Corpus ID: 1411576
Accurate channel state information (CSI) is essential for attaining beamforming gains in single-user (SU) multiple-input multiple…
Expand
Highly Cited
2011
Highly Cited
2011
Distributed Consensus With Limited Communication Data Rate
Tao Li
,
M. Fu
,
Lihua Xie
,
Ji-feng Zhang
IEEE Transactions on Automatic Control
2011
Corpus ID: 17996378
Communication data rate and energy constraints are important factors which have to be considered when investigating distributed…
Expand
Highly Cited
2006
Highly Cited
2006
Single-symbol maximum likelihood decodable linear STBCs
M. Khan
,
B. Rajan
IEEE Transactions on Information Theory
2006
Corpus ID: 16073898
Space-time block codes (STBCs) from orthogonal designs (ODs) and coordinate interleaved orthogonal designs (CIOD) have been…
Expand
Highly Cited
2005
Highly Cited
2005
Analysis and design of symbol mappers for iteratively decoded BICM
Jun Tan
,
Gordon L. Stüber
IEEE Transactions on Wireless Communications
2005
Corpus ID: 14552151
Iterative decoding and demodulation of bit-interleaved coded modulation (BICM) is investigated. The union bound on the error…
Expand
Highly Cited
2004
Highly Cited
2004
Efficient, low-complexity image coding with a set-partitioning embedded block coder
W. Pearlman
,
A. Islam
,
N. Nagaraj
,
A. Said
IEEE transactions on circuits and systems for…
2004
Corpus ID: 347171
We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set…
Expand
Highly Cited
2003
Highly Cited
2003
Orthogonal designs with maximal rates
Xue-Bin Liang
IEEE Transactions on Information Theory
2003
Corpus ID: 27879286
Orthogonal designs have been used as space-time block codes for wireless communications with multiple transmit antennas, which…
Expand
Highly Cited
1998
Highly Cited
1998
Applications of space-time block codes and interference suppression for high capacity and high data rate wireless systems
A. Naguib
,
Nambirajan Seshadri
,
A. R. Calderbank
Conference Record of Thirty-Second Asilomar…
1998
Corpus ID: 33348089
This paper presents a combined interference suppression and ML decoding scheme for space-time block codes that can effectively…
Expand
Review
1998
Review
1998
Error-resilient video coding in the ISO MPEG-4 standard
R. Talluri
IEEE Communications Magazine
1998
Corpus ID: 14186070
This article describes error resilience aspects of the video coding techniques that are standardized in the ISO MPEC-4 standard…
Expand
Highly Cited
1979
Highly Cited
1979
Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.)
J. Cain
,
G. Clark
,
J. Geist
IEEE Transactions on Information Theory
1979
Corpus ID: 31402383
The structure of punctured convolutional cedes is described, and it is indicated how their use simplifies the design of maximum…
Expand
Highly Cited
1979
Highly Cited
1979
Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding
D. Graupe
1979
Corpus ID: 61300005
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)
ACCEPT & CONTINUE