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
fDate :
7/1/2000 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
