In dalai-ISIT-2013b, dalai-TIT-2013, a modification of the Lovász theta function, called ϑ(ρ), was introduced for the purpose of studying error exponents for codes over discrete memoryless channels. It was mentioned that this function allows one to upper bound the multi-letter version of Gallager’s expurgated lower bound on the reliability function, but this property was only proved for some particular cases. In this letter, we give a general proof and we show how this can be used for the evaluation of the expurgated bound. We finally consider some algebraic properties of the function ϑ(ρ). IEEE
Bounding Gallager’s Expurgated Bound
Dalai, Marco
2017-01-01
Abstract
In dalai-ISIT-2013b, dalai-TIT-2013, a modification of the Lovász theta function, called ϑ(ρ), was introduced for the purpose of studying error exponents for codes over discrete memoryless channels. It was mentioned that this function allows one to upper bound the multi-letter version of Gallager’s expurgated lower bound on the reliability function, but this property was only proved for some particular cases. In this letter, we give a general proof and we show how this can be used for the evaluation of the expurgated bound. We finally consider some algebraic properties of the function ϑ(ρ). IEEEFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
D-COMLETT-2017_v3.pdf
gestori archivio
Descrizione: Articolo principale
Tipologia:
Full Text
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
325.28 kB
Formato
Adobe PDF
|
325.28 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.