DocumentCode
1355858
Title
Bounds on the state complexity of codes from the Hermitian function field and its subfields
Author
Shany, Yaron ; Be´ery, Yair
Author_Institution
Dept. of Electron. & Eng. Syst., Tel Aviv Univ., Israel
Volume
46
Issue
4
fYear
2000
fDate
7/1/2000 12:00:00 AM
Firstpage
1523
Lastpage
1527
Abstract
An upper bound on the minimal state complexity of codes from the Hermitian function field and some of its subfields is derived. Coordinate orderings under which the state complexity of the codes is not above the bound are specified. For the self-dual Hermitian code it is proved that the bound coincides with the minimal state complexity of the code. Finally, it is shown that Hermitian codes over fields of characteristic 2 admit a recursive twisted squaring construction
Keywords
Goppa codes; computational complexity; dual codes; geometric codes; Hermitian function field; codes; coordinate orderings; minimal state complexity; recursive twisted squaring construction; self-dual Hermitian code; state complexity; subfields; Decoding; Galois fields; Hamming distance; Joining processes; Linear code; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.850686
Filename
850686
Link To Document