The linear programming bound for codes over finite Frobenius rings

The linear programming bound for codes over finite Frobenius rings

In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Designs, codes, and cryptography codes, and cryptography, 2007-03, Vol.42 (3), Article 289
Hauptverfasser: Byrne, Eimear, Greferath, Marcus, O’Sullivan, Michael E.
Format: Artikel
Sprache:eng
Schlagworte:
Block codes
Linear programming
Rings (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-006-9035-4