Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,394,727 papers from all fields of science
Search
Sign In
Create Free Account
Error exponent
In information theory, the error exponent of a channel code or source code over the block length of the code is the logarithm of the error…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Channel capacity
Codec
Data compression
Noisy-channel coding theorem
Expand
Broader (1)
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Radar sensor network for target detection using Chernoff information and relative entropy
Ishrat Maherin
,
Q. Liang
Physical Communication
2014
Corpus ID: 23962360
2011
2011
Mappings for BICM in UWB Scenarios
C. Stierstorfer
,
R. Fischer
2011
Corpus ID: 15617613
In this paper mappings for square QAM constellations employed for bit-interleaved coded modulation (BICM) in ultra-wide band…
Expand
2007
2007
Practical distributed source coding and its application to the compression of encrypted data
D. Schonberg
2007
Corpus ID: 26317011
Practical Distributed Source Coding and Its Application to the Compression of Encrypted Data
2006
2006
On the Error Exponents of Some Improved Tangential-Sphere Bounds
M. Twitto
,
I. Sason
arXiv.org
2006
Corpus ID: 3266326
The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the…
Expand
2005
2005
On the error exponent of trellis source coding
I. Hen
,
N. Merhav
IEEE Transactions on Information Theory
2005
Corpus ID: 11727116
In this paper, we develop a single-letter lower bound on the error exponent for the problem of trellis source coding. We…
Expand
2005
2005
Sequential random coding error exponents for multiple access channels
Cheng Chang
,
A. Sahai
International Conference on Wireless Networks…
2005
Corpus ID: 17611955
Discrete-time memoryless multiple access channels (MACs) are a useful abstraction of the uplink for many centralized wireless…
Expand
2001
2001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I
G. Beyer
,
K. Engdahl
,
K. Zigangirov
IEEE Transactions on Information Theory
2001
Corpus ID: 7237886
For pt.I see ibid., vol.47, no.7, p.2782-92 (2001). In this paper we analyze a multilevel coded modulation system using phase…
Expand
2000
2000
Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel
T. Guess
,
M. Varanasi
IEEE Transactions on Information Theory
2000
Corpus ID: 6369749
Random-coding error exponents are derived for the Gaussian code-division multiple-access (CDMA) channel for the maximum…
Expand
1999
1999
On the error exponent for memoryless flat fading channels with channel-state-information feedback
Walid K. M. Ahmed
,
P. McLane
IEEE Communications Letters
1999
Corpus ID: 11143026
We derive the random coding error exponent for the time-independent flat fading channel with perfect knowledge of the channel…
Expand
Highly Cited
1983
Highly Cited
1983
Bounds on distances and error exponents of unit memory codes
C. Thommesen
,
J. Justesen
IEEE Transactions on Information Theory
1983
Corpus ID: 40635585
Binary unit memory codes, originally introduced by Lee, are investigated. A few examples of constant unit memory codes are given…
Expand
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