𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acute semigroups, the order bound on the minimum distance, and the Feng-Rao improvements

✍ Scribed by Bras-Amoros, M.

Book ID
114638326
Publisher
IEEE
Year
2004
Tongue
English
Weight
342 KB
Volume
50
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing Weierstrass Semigroups and the
Computing Weierstrass Semigroups and the Feng–Rao Distance from Singular Plane Models
✍ A Campillo; J.I FarrΓ‘n πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 202 KB

We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at in"nity of a singular plane model for the curve. As a byproduct, the method also provides us with a basis for the spaces L(mP) and the c

The optimality of Feng–Rao designed mini
The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order
✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 313 KB πŸ‘ 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet