MINIMUM DISTANCES OF ERROR-CORRECTING CODES IN INCIDENCE RINGS

MINIMUM DISTANCES OF ERROR-CORRECTING CODES IN INCIDENCE RINGS

The main theorem of this paper gives a formula for the largest minimum distance of error‐correcting codes considered as ideals in incidence rings defined by directed graphs.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Journal of Mathematics and Mathematical Sciences 2003, Vol.2003 (13), p.827-833-054
1. Verfasser: Kelarev, A. V.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The main theorem of this paper gives a formula for the largest minimum distance of error‐correcting codes considered as ideals in incidence rings defined by directed graphs.
ISSN:0161-1712
1687-0425
DOI:10.1155/S0161171203204063