Search

Your search keyword '"Tauste Campo, Adria"' showing total 16 results
Start Over Author "Tauste Campo, Adria"
16 results on '"Tauste Campo, Adria"'

5. On Random Network Coding for Multicast

Author

Tauste-Campo, Adria and Grant, Alex

Subjects
Computer Science - Information Theory
Abstract

Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required sources. One of the main theoretical motivations for random network codes stems from the lower bound on the probability of successful decoding reported by Ho et. al. (2003). This result demonstrates that all sinks in a linearly solvable network can successfully decode all sources provided that the random code field size is large enough. This paper develops a new bound on the probability of successful decoding., Comment: 5 pages, 4 figures. Submitted to 2007 IEEE International Symposium on Information Theory

Published
2007

9. Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verdu-Han Bounds Are Tight

Author

Vazquez-Vilar, Gonzalo, Tauste Campo, Adria, Guillen I Fabregas, Albert, Martinez, Alfonso, Guillen i Fabregas, Albert [0000-0003-2795-1124], and Apollo - University of Cambridge Repository

Subjects
Electronic mail, Hypothesis testing, meta-converse, information spectrum, channel coding, Testing, Error probability, Random variables, Shannon theory, Channel coding, Bayes methods
Abstract

Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verdú-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose. This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.

Published
2016

10. Multi-Class Source-Channel Coding

Author

Bocharova, Irina E., primary, Guillen i Fabregas, Albert, additional, Kudryashov, Boris D., additional, Martinez, Alfonso, additional, Tauste Campo, Adria, additional, and Vazquez-Vilar, Gonzalo, additional

Published
2016
Full Text
View/download PDF

14. Bayesian $M$ -Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight.

Author

Vazquez-Vilar, Gonzalo, Tauste Campo, Adria, Guillen i Fabregas, Albert, and Martinez, Alfonso

Subjects
*BROADCAST data systems, *CODING theory, *MULTIPLEXING, *BROADCAST channels, *SIGNAL theory, *INFORMATION theory, *DECODING algorithms, *ERROR-correcting codes
Abstract

Two alternative exact characterizations of the minimum error probability of Bayesian $M$ -ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verdú-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose. [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results