Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 15
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint approximations of lower and upper bounds to the error probability in channel coding

  • Font Segura, Josep
  • Vázquez Vilar, Gonzalo
  • Martínez, Alfonso
  • Guillén I Fàbregas, Albert
  • Lancho Serrano, Alejandro
This paper has been presented at: 52nd Annual Conference on Information Sciences and Systems (CISS), Saddlepoint approximations of the meta-converse and random-coding union bounds are derived. These bounds accurately characterize the channel coding minimum error probability for symmetric memoryless channels in a wide range of system parameters. The proposed approximations are simple to compute and yield a unified analysis of both hypothesis-testing lower bounds and random-coding upper bounds., This work has been funded in part by the European Research Council under ERC grant agreement 725411, by the Spanish Ministry of Economy and Competitiveness under grants TEC2013-41718-R, FJCI-2014-22747, IJCI-2015-27020, and TEC2016-78434-C3 (AEI/FEDER, EU), and by the Spanish Ministry of Education, Culture and Sport under grant FPU14/01274.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint Approximation of the Error Probability of Binary Hypothesis Testing

  • Vázquez Vilar, Gonzalo
  • Guillén i Fàbregas, Albert
  • Koch, Tobias Mirco
  • Lancho Serrano, Alejandro
We propose a saddlepoint approximation of the error probability of a binary hypothesis test between two i.i.d. distributions. The approximation is accurate, simple to compute, and yields a unified analysis in different asymptotic regimes. The proposed formulation is used to efficiently compute the meta-converse lower bound for moderate block-lengths in several cases of interest., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under grants TEC2013-41718-R, RYC-201416332, IJCI-2015-27020 and TEC2016-78434-C3 (AEI/FEDER, EU), by the Madrid Autonomous Community under grant S2103/ICE-2845 and by the Spanish Ministry of Education, Culture and Sport under grant FPU14/01274.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

The Error Probability of Generalized Perfect Codes

  • Vázquez Vilar, Gonzalo
  • Guillén I Fàbregas, Albert
  • Verdú, Sergio
This paper has been presented at : IEEE International Symposium on Information Theory 2018, We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This new definition generalizes previous definitions and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to attain the meta-converse lower bound., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under Grants TEC2016-78434-C3 and IJCI-2015-27020, by the National Science Foundation under Grant CCF-1513915 and by the Center for Science of Information, an NSF Science and Technology Center under Grant CCF-0939370.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

A sphere-packing exponent for mismatched decoding

  • Kangarshahi, Ehsan Asadi
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual., We derive a sphere-packing error exponent for mismatched decoding over discrete memoryless channels. We find a lower bound to the probability of error of mismatched decoding that decays exponentially for coding rates smaller than a new upper bound to the mismatch capacity. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity., This work was supported in part by the European Research Council under Grant 725411.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the random coding error probability for constant-composition codes

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2019 IEEE International Symposium on Information Theory (ISIT), celebrada del 7 al 12 de juliol de 2019 a Paris, França., Saddlepoint approximations to the error probability are derived for multiple-cost-constrained random coding ensembles where codewords satisfy a set of constraints. Constantcomposition inputs over a binary symmetric channel are studied as a particular case. For codewords with equiprobable empirical distribution, the analysis recovers the same error exponent and pre-exponential polynomial decay as the uniform i.i.d. ensemble and provides an explicit formula for the loss in prefactor (thirdorder term) incurred by the constant-composition ensemble., This work has been funded in part by the European Research Council under grant 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Typical random coding exponent for finite-state channels

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font Segura, Josep
Comunicació presentada a 2022 IEEE International Symposium on Information Theory (ISIT), celebrat del 26 de juny a l'1 de juliol de 2022 a Espoo, Finlàndia., We derive a lower bound on the typical random-coding (TRC) exponent of pairwise-independent codeword ensembles used over a finite-state channel (FSC) at rates below capacity. Under some conditions, we also show that the probability of selecting a code from the ensemble with an error exponent larger than our lower bound tends to one as the codeword length tends to infinity. Our result, presented here for the FSC, also applies to compound channels., This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Catalan Secretary of Universities ´ and Research, by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 801370, and by the European Research Council under ERC grant agreement 725411.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

A dual-domain achievability of the typical error exponent

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font Segura, Josep
Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual., For random-coding ensembles with pairwise-independent codewords, we show that the probability that the exponent of a given code from the ensemble being smaller than an upper bound on the typical random-coding exponent is vanishingly small. This upper bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memoryless channels. Our result recovers these as special cases and remains valid for arbitrary alphabets and channel memory, as well as arbitrary ensembles with pairwise independent codewords., This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Secretary of Universities and Research (Government of Catalonia), by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 801370, and by the European Research Council under ERC grant agreement 725411.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Error exponents of discrete memoryless channels under small mismatch

  • Patel, Priyanka
  • Molina Oliveras, Francesc|||0000-0002-3188-5599
  • Guillén Fàbregas, Albert|||0000-0003-2795-1124
This paper investigates achievable error exponents of i.i.d. and constant-composition codes for a decoder whose decoding metric is close to the channel probability law in terms of relative entropy. We derive approximations of the worst-case achievable error exponents as functions of the radius of a small relative entropy ball centered at the decoding metric, and characterize the error terms of the underlying approximations. © 2024 IEEE., This work was supported in part by the European Research Council under Grant 725411 and by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina is also supported by the Spanish Ministry of Universities through Margarita Salas Fellowship.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Nearest neighbor decoding for a class of compound channels

  • Molina Oliveras, Francesc|||0000-0002-3188-5599
  • Patel, Priyanka
  • Guillén Fàbregas, Albert|||0000-0003-2795-1124
We study Gaussian i.i.d. codebooks and nearest neighbor decoding over continuous-alphabet channels. We define a class of compound channels that are within a small radius relative entropy ball centered at the nearest neighbor decoding metric. We derive approximations to the worst-case achievable rates and find the penalty terms proportional to the square root of the ball radius. © 2024 IEEE., This work was supported by the European Research Council under Grant 725411 and by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina is also supported by the Spanish Ministry of Universities through Margarita Salas Fellowship., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Nearest neighbor decoding for a class of compound channels

  • Molina Oliveras, Francesc
  • Patel, Priyanka
  • Guillén Fàbregas, Albert
We study Gaussian i.i.d. codebooks and nearest neighbor decoding over continuous-alphabet channels. We define a class of compound channels that are within a small radius relative entropy ball centered at the nearest neighbor decoding metric. We derive approximations to the worst-case achievable rates and find the penalty terms proportional to the square root of the ball radius. © 2024 IEEE., This work was supported by the European Research Council under Grant 725411 and by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina is also supported by the Spanish Ministry of Universities through Margarita Salas Fellowship., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Typical random coding exponent for finite-state channels

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font Segura, Josep
Comunicació presentada a 2022 IEEE International Symposium on Information Theory (ISIT), celebrat del 26 de juny a l'1 de juliol de 2022 a Espoo, Finlàndia., We derive a lower bound on the typical random-coding (TRC) exponent of pairwise-independent codeword ensembles used over a finite-state channel (FSC) at rates below capacity. Under some conditions, we also show that the probability of selecting a code from the ensemble with an error exponent larger than our lower bound tends to one as the codeword length tends to infinity. Our result, presented here for the FSC, also applies to compound channels., This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Catalan Secretary of Universities ´ and Research, by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 801370, and by the European Research Council under ERC grant agreement 725411.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

A sphere-packing exponent for mismatched decoding

  • Kangarshahi, Ehsan Asadi
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual., We derive a sphere-packing error exponent for mismatched decoding over discrete memoryless channels. We find a lower bound to the probability of error of mismatched decoding that decays exponentially for coding rates smaller than a new upper bound to the mismatch capacity. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity., This work was supported in part by the European Research Council under Grant 725411.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Error exponents of discrete memoryless channels under small mismatch

  • Patel, Priyanka
  • Molina Oliveras, Francesc
  • Guillén Fàbregas, Albert
This paper investigates achievable error exponents of i.i.d. and constant-composition codes for a decoder whose decoding metric is close to the channel probability law in terms of relative entropy. We derive approximations of the worst-case achievable error exponents as functions of the radius of a small relative entropy ball centered at the decoding metric, and characterize the error terms of the underlying approximations. © 2024 IEEE., This work was supported in part by the European Research Council under Grant 725411 and by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina is also supported by the Spanish Ministry of Universities through Margarita Salas Fellowship., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

A dual-domain achievability of the typical error exponent

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font Segura, Josep
Comunicació presentada a 2021 IEEE International Symposium on Information Theory (ISIT), celebrat del 12 al 20 de juliol de 2021 de manera virtual., For random-coding ensembles with pairwise-independent codewords, we show that the probability that the exponent of a given code from the ensemble being smaller than an upper bound on the typical random-coding exponent is vanishingly small. This upper bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memoryless channels. Our result recovers these as special cases and remains valid for arbitrary alphabets and channel memory, as well as arbitrary ensembles with pairwise independent codewords., This work has been funded in part by the postdoctoral fellowship programme Beatriu de Pinos, funded by the Secretary of Universities and Research (Government of Catalonia), by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 801370, and by the European Research Council under ERC grant agreement 725411.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the random coding error probability for constant-composition codes

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2019 IEEE International Symposium on Information Theory (ISIT), celebrada del 7 al 12 de juliol de 2019 a Paris, França., Saddlepoint approximations to the error probability are derived for multiple-cost-constrained random coding ensembles where codewords satisfy a set of constraints. Constantcomposition inputs over a binary symmetric channel are studied as a particular case. For codewords with equiprobable empirical distribution, the analysis recovers the same error exponent and pre-exponential polynomial decay as the uniform i.i.d. ensemble and provides an explicit formula for the loss in prefactor (thirdorder term) incurred by the constant-composition ensemble., This work has been funded in part by the European Research Council under grant 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.