A goppa-like bound on the trellis state complexity of algebraic-geometric codes

DOI10.1109/TIT.2002.808129MaRDI QIDQ4679952zbMATH OpenOpenAlexFDO

Authors Carlos Munuera, Fernando Torres

Publication date 31 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0212038

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Bounds on codes (94B65)

Abstract: For a linear code $cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(cC)$ of $cC$ is upper bounded by $w(cC):=min(k,n-k)$. In this paper we point out some new lower bounds for $s(cC)$. In particular, if $cC$ is an Algebraic Geometric code, then $s(cC)geqw(cC)-(g-a)$, where $g$ is the genus of the underlying curve and $a$ is the abundance of the code.

Recommendations

• Bounding the trellis state complexity of algebraic geometric codes
• Lower bounds on the state complexity of geometric Goppa codes
• Goppa geometric codes achieving the Gilbert-Varshamov bound
• scientific article; zbMATH DE number 1775409
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
• On the state complexity of hyperelliptic codes
• Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
• The order bound for general algebraic geometric codes
• The trellis complexity of convolutional codes

Cited in

(3)

• Bounding the trellis state complexity of algebraic geometric codes
• Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
• Lower bounds on the state complexity of geometric Goppa codes

This page was built for publication: A goppa-like bound on the trellis state complexity of algebraic-geometric codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679952)