Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Information Theory
Article . 1998 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A lower bound on the error probability for signals in white Gaussian noise

Authors: Séguin, Gérald E.;

A lower bound on the error probability for signals in white Gaussian noise

Abstract

Summary: The author applies a recent inequality by \textit{D. de Caen} [Discrete Math. 169, 217-220 (1997; Zbl 0874.60001)] to derive a lower bound on the probability of error for \(M\)-ary signals derived from a binary linear code and used on the additive white Gaussian noise channel with a maximum-likelihood decoder. This bound depends only on the weight enumerator of the code and the signal-to-noise ratio \(E_b/N_0\). He shows that this bound converges to the union upper bound as \(E_b/N_0\) goes to infinity. Finally, by means of examples, he compares his lower bound with those of \textit{C. E. Shannon} [Probability of error for optimal codes in a Gaussian channel, Bell Syst. Tech. J. 38, No. 3, 611-656 (1959)] and \textit{P. F. Swaszek} [IEEE Trans. Inf. Theory 41, 837-841 (1995; Zbl 0820.94007)] and with \textit{G. Poltyrev}'s [IEEE Trans. Inf. Theory 40, 1284-1292 (1994; Zbl 0821.94035)] upper bound.

Related Organizations
Keywords

Signal theory (characterization, reconstruction, filtering, etc.), Bounds on codes, Modulation and demodulation in information and communication theory, linear code, signal-to-noise ratio, Error probability in coding theory, additive Gaussian noise, weight enumerator

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    38
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
38
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!