English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behavior of such bounds for <formula formulatype="inline"><tex Notation="TeX">$r\geq 2$</tex></formula> differs from that of the classical Feng&#x2013;Rao distance <formula formulatype="inline"><tex Notation="TeX">$(r=1)$</tex></formula> by the so-called Feng&#x2013;Rao numbers. This paper is addressed to compute the Feng&#x2013;Rao numbers for numerical semigroups of embedding dimension two (with two generators), obtaining a closed simple formula for the general case by using numerical semigroup techniques. These involve the computation of the Ap&#x00E9;ry set with respect to an integer of the semigroups under consideration. The formula obtained is applied to lower bounding the generalized Hamming weights, improving the bound given by Kirfel and Pellikaan in terms of the classical Feng&#x2013;Rao distance. We also compare our bound with a modification of the Griesmer bound, improving this one in many cases.

On the Weight Hierarchy of Codes Coming From Semigroups With Two Generators