Bounds on the state complexity of geometric Goppa codes

Bounds on the state complexity of geometric Goppa codes

We give lower bounds on the state complexity of geometric Goppa codes. For Hermitian codes we calculate the DLP bound, /spl nabla/, and determine when /spl nabla/ is tight and when it is not.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Blackmore, T., Norton, G.H.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Decoding
H infinity control
Reed-Solomon codes
State-space methods
Terminology
Upper bound
Viterbi algorithm
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give lower bounds on the state complexity of geometric Goppa codes. For Hermitian codes we calculate the DLP bound, /spl nabla/, and determine when /spl nabla/ is tight and when it is not.
DOI:10.1109/ISIT.2000.866465