Computing the Feng-Rao distances for codes from order domains

DOI10.1016/J.JALGEBRA.2006.06.018MaRDI QIDQ875112zbMATH OpenOpenAlexFDO

Authors Diego Ruano

Publication date 11 April 2007

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgebra.2006.06.018

zbMATH Keywords

evaluation codealgebraic geometry codeorder domaincodes from order domainsFeng-Rao distancesGröbner basisApéry set

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Some algorithms for computing the minimum distance of evaluation codes
• Goppa-like bounds for the generalized Feng-Rao distances
• Goppa-like bounds for the generalized Feng-Rao distances.
• Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
• Evaluation codes from order domain theory

Cites work

• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 1472128 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• scientific article; zbMATH DE number 3101854 (Why is no real title available?)
• Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
• On the structure of order domains
• Syzygies of affine toric varieties
• The short resolution of a lattice ideal

Cited in

(2)

• Some algorithms for computing the minimum distance of evaluation codes
• Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance

This page was built for publication: Computing the Feng-Rao distances for codes from order domains

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