3 search results - page 1 / 1 » Bounding the Trellis State Complexity of Algebraic Geometric... |
AAECC
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
TIT
1998
14 years 9 months ago
1998
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...