DocumentCode
2386962
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
fYear
2000
fDate
2000
Firstpage
170
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866465
Filename
866465
Link To Document