This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinite-valued, distances. The bound is obtained by combining a previous extension of the Elias bound, introduced by Blahut, with an extension of a bound previously introduced by the author which builds upon ideas of Gallager, Lova ́sz and Marton. The result can in fact be interpreted as a unification of the Elias bound and of Lova ́sz’s bound on graph (or zero-error) capacity, both being recovered as particular cases of the one presented here. Previous extensions of the Elias bound by Berlekamp, Blahut and Piret are shown to be included as particular cases of our bound. Applications to the reliability function are then discussed.

Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs

DALAI, Marco
2015-01-01

Abstract

This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinite-valued, distances. The bound is obtained by combining a previous extension of the Elias bound, introduced by Blahut, with an extension of a bound previously introduced by the author which builds upon ideas of Gallager, Lova ́sz and Marton. The result can in fact be interpreted as a unification of the Elias bound and of Lova ́sz’s bound on graph (or zero-error) capacity, both being recovered as particular cases of the one presented here. Previous extensions of the Elias bound by Berlekamp, Blahut and Piret are shown to be included as particular cases of our bound. Applications to the reliability function are then discussed.
File in questo prodotto:
File Dimensione Formato  
D_TIT-arxiv_2015.pdf

gestori archivio

Descrizione: Articolo completo
Tipologia: Full Text
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 375.35 kB
Formato Adobe PDF
375.35 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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11379/465964
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact