Bounds on the state complexity of codes from the Hermitian function field and its subfields

Yaron Shany; Yair Be'ery

doi:10.1109/18.850686

Bounds on the state complexity of codes from the Hermitian function field and its subfields

Yaron Shany
, Yair Be'ery

Engineering General

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	1523-1527
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	4
DOIs	https://doi.org/10.1109/18.850686
State	Published - Jul 2000

Access to Document

10.1109/18.850686

Cite this

@article{413dca2def1f4f60ba1134c1d275b66b,

title = "Bounds on the state complexity of codes from the Hermitian function field and its subfields",

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.",

author = "Yaron Shany and Yair Be'ery",

year = "2000",

month = jul,

doi = "10.1109/18.850686",

language = "אנגלית",

volume = "46",

pages = "1523--1527",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Bounds on the state complexity of codes from the Hermitian function field and its subfields

AU - Shany, Yaron

AU - Be'ery, Yair

PY - 2000/7

Y1 - 2000/7

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0034226863

U2 - 10.1109/18.850686

DO - 10.1109/18.850686

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0034226863

SN - 0018-9448

VL - 46

SP - 1523

EP - 1527

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

ER -

Bounds on the state complexity of codes from the Hermitian function field and its subfields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this