Artículos de revistas
A goppa-like bound on the trellis state complexity of algebraic-geometric codes
Registration in:
Ieee Transactions On Information Theory. Ieee-inst Electrical Electronics Engineers Inc, v. 49, n. 3, n. 733, n. 737, 2003.
0018-9448
WOS:000181449200016
10.1109/TIT.2002.808129
Author
Munuera, C
Torres, F
Institutions
Abstract
For a linear code C of length n and dimension k, Wolf noticed that the trellis state complexity s(C) of C is upper-bounded by := w(C) min(k, n - k). In this correspondence, we point out some new lower hounds for s(C). In particular, if C is an algebraic-geometric code, then s (C) greater than or equal to w (C) - (g - a), where g is the genus of the underlying curve and a is the abundance of the code. 49 3 733 737