Title :
Bounds on the state complexity of geometric Goppa codes
Author :
Blackmore, Tim ; Norton, Graham H.
Author_Institution :
Centre for Commun. Res., Bristol Univ., UK
Abstract :
We give lower bounds on the state complexity of geometric Goppa codes. For Hermitian codes we calculate the DLP bound, ∇, and determine when ∇ is tight and when it is not
Keywords :
Goppa codes; computational complexity; geometric codes; DLP bound; Hermitian codes; geometric Goppa codes; lower bounds; state complexity; Art; Books; Decoding; H infinity control; Reed-Solomon codes; State-space methods; Terminology; Upper bound; Viterbi algorithm;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866465
