Pasar al contenido principal

Resultados relacionados

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

Repositorio Digital de la UPF
Publicación 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.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Dual domain expurgated error exponents for source coding with side information

  • Dabirnia, Mehdi|||0000-0002-6559-9363
  • Joudeh, Hamdi|||0000-0002-7162-0325
  • Guillén Fàbregas, Albert|||0000-0003-2795-1124
© 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., We introduce an expurgation method for source coding with side information that enables direct dual-domain derivations of expurgated error exponents. Dual-domain methods yield optimization problems over few parameters, with any sub-optimal choice resulting in an achievable exponent, as opposed to primal-domain optimization over distributions. In addition, dual-domain methods naturally allow for general alphabets and/or memory. We derive two such expurgated error exponents for different random-coding ensembles in the case where the decoder is possibly mismatched with respect to the source and side information joint distribution. We show the better of the exponents coincides with the Csiszár-Körner exponent obtained via a graph decomposition lemma. We show some numerical examples that illustrate the differences between the two exponents and show that in the case of source coding without side information, the expurgated exponent coincides with the error exponent of the source optimal code., This work was supported in part by the European Research Council under Grants 101116550, 101142747 and 101158232, and in part by the Spanish Ministry of Economy and Competitiveness under Grants PID2020-116683GBC22 and PID2021-128373OB-I00 and partially by the WAVE-XL project (PID2024-160457OB-I00) funded by MCIN/AEI/10.13039/501100011033 and by FEDER, UE.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Dual domain expurgated error exponents for source coding with side information

  • Dabirnia, Mehdi
  • Joudeh, Hamdi
  • Guillén Fàbregas, Albert
© 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., We introduce an expurgation method for source coding with side information that enables direct dual-domain derivations of expurgated error exponents. Dual-domain methods yield optimization problems over few parameters, with any sub-optimal choice resulting in an achievable exponent, as opposed to primal-domain optimization over distributions. In addition, dual-domain methods naturally allow for general alphabets and/or memory. We derive two such expurgated error exponents for different random-coding ensembles in the case where the decoder is possibly mismatched with respect to the source and side information joint distribution. We show the better of the exponents coincides with the Csiszár-Körner exponent obtained via a graph decomposition lemma. We show some numerical examples that illustrate the differences between the two exponents and show that in the case of source coding without side information, the expurgated exponent coincides with the error exponent of the source optimal code., This work was supported in part by the European Research Council under Grants 101116550, 101142747 and 101158232, and in part by the Spanish Ministry of Economy and Competitiveness under Grants PID2020-116683GBC22 and PID2021-128373OB-I00 and partially by the WAVE-XL project (PID2024-160457OB-I00) funded by MCIN/AEI/10.13039/501100011033 and by FEDER, UE., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación 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.