Skip to main content

GENERALIZED AND REFINED ASYMPTOTICS IN FINITE-BLOCKLENGTH INFORMATION THEORY: LAPLACE METHODS AND PROBABILISTIC MODULATION SHAPING FOR COMMUNICATIONS

PID2020-116683GB-C22

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POMPEU FABRA CCT

Resultados relacionados

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

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

A refinement of expurgation

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font-Segura, Josep
We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent., This work was supported in part by the Ramón y Cajal Fellowship Program funded by Spanish Government through the Ministerio de Ciencia, Innovación y Universidades (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 and European Union “NextGenerationEU” Recovery Plan under Grant RYC2021-033908-I, in part by European Research Council under ERC Grant Agreement 725441 and Agreement 101142747, and in part by Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Mismatched binary hypothesis testing: error exponent sensitivity

  • Boroumand, Parham
  • Guillén i Fábregas, A. (Albert)
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distributions used in the likelihood ratio test, sequential probability ratio test, and Hoeffding’s generalized likelihood ratio test in the composite setting. When the real distributions are within a small divergence ball of the test distributions, we find the deviation of the worst-case error exponent of each test with respect to the matched error exponent. In addition, we consider the case where an adversary tampers with the observation, again within a divergence ball of the observation type. We show that the tests are more sensitive to distribution mismatch than to adversarial observation tampering., This work was supported in part by the European Research Council under Grant 725411 and in part by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

On the angular momentum and spin of generalized electromagnetic field for r-vectors in (k, n) space-time dimensions

  • Martínez, Alfonso, 1973-
  • Colombaro, Ivano
  • Font Segura, Josep
This paper studies the relativistic angular momentum for the generalized electromagnetic field, described by r-vectors in (k, n) space-time dimensions, with exterioralgebraic methods. First, the angular-momentum tensor is derived from the invariance of the Lagrangian to space-time rotations (Lorentz transformations), avoiding the explicit need of the canonical tensor in Noether’s theorem. The derivation proves the conservation law of angular momentum for generic values of r, k, and n. Second, an integral expression for the flux of the tensor across a (k + n − 1)-dimensional surface of constant -th space-time coordinate is provided in terms of the normal modes of the field; this analysis is a natural generalization of the standard analysis of electromagnetism, i. e. a three-dimensional space integral at constant time. Third, a brief discussion on the orbital angular momentum and the spin of the generalized electromagnetic field, including their expression in complex-valued circular polarizations, is provided for generic values of r, k, and n., This work has been funded in part by the Spanish Ministry of Science, Innovation and Universities under grants TEC2016-78434-C3-1-R, BES-2017-081360, and PID2020-116683GB-C22. Alfonso Martinez is a Serra–Húnter Fellow.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Minimum probability of error of list M-ary hypothesis testing

  • Kangarshahi, Ehsan Asadi
  • Guillén i Fábregas, A. (Albert)
We study a variation of Bayesian M-ary hypothesis testing in which the test outputs a list of L candidates out of the M possible upon processing the observation. We study the minimum error probability of list hypothesis testing, where an error is defined as the event where the true hypothesis is not in the list output by the test. We derive two exact expressions of the minimum probability or error. The first is expressed as the error probability of a certain non-Bayesian binary hypothesis test and is reminiscent of the meta-converse bound by Polyanskiy, Poor and Verdú (2010). The second, is expressed as the tail probability of the likelihood ratio between the two distributions involved in the aforementioned non-Bayesian binary hypothesis test. Hypothesis testing, error probability, information theory., European Research Council (Grant 725411); Spanish Ministry of Economy and Competitiveness (Grant PID2020-116683GB-C22).
UPCommons. Portal del coneixement obert de la UPC
Publication 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
Publication 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
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Achievable rates and error exponents for a class of mismatched compound channels

  • Patel, Priyanka
  • Molina Oliveras, Francesc|||0000-0002-3188-5599
  • Guillén Fàbregas, Albert|||0000-0003-2795-1124
This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and continuous-alphabet channels, we derive approximations of the worst-case achievable information rates and error exponents as a function of the radius of a small relative entropy ball centered at the decoding metric, allowing the characterization of the loss incurred due to imperfect channel estimation. We provide a number of examples including symmetric metrics and modulo-additive noise metrics for discrete systems, and nearest neighbor decoding for continuous-alphabet channels, where we derive the approximation when the channel admits arbitrary statistics and when it is assumed noise-additive with unknown finite second-order moment., This work was supported in part by the European Research Council under Grants 725411 and 101142747, and in part by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina was also supported by a Margarita Salas Fellowship., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication 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
Publication Artículo científico (JournalArticle)

Achievable rates and error exponents for a class of mismatched compound channels

  • Patel, Priyanka
  • Molina Oliveras, Francesc
  • Guillén Fàbregas, Albert
This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and continuous-alphabet channels, we derive approximations of the worst-case achievable information rates and error exponents as a function of the radius of a small relative entropy ball centered at the decoding metric, allowing the characterization of the loss incurred due to imperfect channel estimation. We provide a number of examples including symmetric metrics and modulo-additive noise metrics for discrete systems, and nearest neighbor decoding for continuous-alphabet channels, where we derive the approximation when the channel admits arbitrary statistics and when it is assumed noise-additive with unknown finite second-order moment., This work was supported in part by the European Research Council under Grants 725411 and 101142747, and in part by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22. Francesc Molina was also supported by a Margarita Salas Fellowship., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Minimum probability of error of list M-ary hypothesis testing

  • Kangarshahi, Ehsan Asadi
  • Guillén i Fábregas, A. (Albert)
We study a variation of Bayesian M-ary hypothesis testing in which the test outputs a list of L candidates out of the M possible upon processing the observation. We study the minimum error probability of list hypothesis testing, where an error is defined as the event where the true hypothesis is not in the list output by the test. We derive two exact expressions of the minimum probability or error. The first is expressed as the error probability of a certain non-Bayesian binary hypothesis test and is reminiscent of the meta-converse bound by Polyanskiy, Poor and Verdú (2010). The second, is expressed as the tail probability of the likelihood ratio between the two distributions involved in the aforementioned non-Bayesian binary hypothesis test. Hypothesis testing, error probability, information theory., European Research Council (Grant 725411); Spanish Ministry of Economy and Competitiveness (Grant PID2020-116683GB-C22).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the angular momentum and spin of generalized electromagnetic field for r-vectors in (k, n) space-time dimensions

  • Martínez, Alfonso, 1973-
  • Colombaro, Ivano
  • Font Segura, Josep
This paper studies the relativistic angular momentum for the generalized electromagnetic field, described by r-vectors in (k, n) space-time dimensions, with exterioralgebraic methods. First, the angular-momentum tensor is derived from the invariance of the Lagrangian to space-time rotations (Lorentz transformations), avoiding the explicit need of the canonical tensor in Noether’s theorem. The derivation proves the conservation law of angular momentum for generic values of r, k, and n. Second, an integral expression for the flux of the tensor across a (k + n − 1)-dimensional surface of constant -th space-time coordinate is provided in terms of the normal modes of the field; this analysis is a natural generalization of the standard analysis of electromagnetism, i. e. a three-dimensional space integral at constant time. Third, a brief discussion on the orbital angular momentum and the spin of the generalized electromagnetic field, including their expression in complex-valued circular polarizations, is provided for generic values of r, k, and n., This work has been funded in part by the Spanish Ministry of Science, Innovation and Universities under grants TEC2016-78434-C3-1-R, BES-2017-081360, and PID2020-116683GB-C22. Alfonso Martinez is a Serra–Húnter Fellow.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A refinement of expurgation

  • Cocco, Giuseppe
  • Guillén i Fábregas, A. (Albert)
  • Font-Segura, Josep
We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent., This work was supported in part by the Ramón y Cajal Fellowship Program funded by Spanish Government through the Ministerio de Ciencia, Innovación y Universidades (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 and European Union “NextGenerationEU” Recovery Plan under Grant RYC2021-033908-I, in part by European Research Council under ERC Grant Agreement 725441 and Agreement 101142747, and in part by Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22.
Recercat. Dipósit de la Recerca de Catalunya
Publication 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
Publication Artículo científico (JournalArticle)

Mismatched binary hypothesis testing: error exponent sensitivity

  • Boroumand, Parham
  • Guillén i Fábregas, A. (Albert)
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distributions used in the likelihood ratio test, sequential probability ratio test, and Hoeffding’s generalized likelihood ratio test in the composite setting. When the real distributions are within a small divergence ball of the test distributions, we find the deviation of the worst-case error exponent of each test with respect to the matched error exponent. In addition, we consider the case where an adversary tampers with the observation, again within a divergence ball of the observation type. We show that the tests are more sensitive to distribution mismatch than to adversarial observation tampering., This work was supported in part by the European Research Council under Grant 725411 and in part by the Spanish Ministry of Economy and Competitiveness under Grant PID2020-116683GB-C22.