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

DOI10.1109/TIT.2013.2285217MaRDI QIDQ5346159zbMATH OpenFDO

Authors Manuel Delgado, J. I. Farrán, Pedro A. García Sánchez, D. Llena

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: 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 behaviour of such bounds for r > 1 differs from that of the classical Feng-Rao distance (r=1) by the so-called Feng-Rao numbers. This paper is addressed to compute the Feng-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'ery 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-Rao distance. We also compare our bound with a modification of the Griesmer bound, improving this one in many cases.

Cited in

(14)

• On codes, -codes and -generators
• Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
• A class of cyclotomic linear codes and their generalized Hamming weights
• The second Feng-Rao number for codes coming from telescopic semigroups
• On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
• On the weight hierarchy of the semiprimitive codes
• Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
• On geometric Goppa codes from elementary abelian \(p\)-extensions of \(\mathbb{F}_{p^s}(x)\)
• Cyclotomic numerical semigroups.
• Isolated factorizations and their applications in simplicial affine semigroups
• A note on half of some MED semigroups of maximal or almost maximal length
• Certified algorithms for numerical semigroups in Rocq
• The structure theorem for sets of lengths for numerical semigroups
• Elements with unique length factorization of a numerical semigroup generated by three consecutive numbers

Describes a project that uses

Uses Software

• SINGULAR
• GAP
• brnoeth.lib
• intpic
• numericalsgps

This page was built for publication: On the Weight Hierarchy of Codes Coming From Semigroups With Two Generators

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