Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes

DOI10.1109/TIT.2014.2345375MaRDI QIDQ2986079zbMATH OpenOpenAlexWikidataFDO

Authors Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

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

Abstract: Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes our bound is often tight. Furthermore, for these codes the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.

Cited in

(18)

• On nested code pairs from the Hermitian curve
• Higher Hamming weights for locally recoverable codes on algebraic curves
• Minimum-weight codewords of the Hermitian codes are supported on complete intersections
• Recent advances in non-perfect secret sharing schemes
• Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
• Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
• Hermitian codes and complete intersections
• Relative generalized Hamming weights of evaluation codes
• Classical access structures of ramp secret sharing based on quantum stabilizer codes
• Relative generalized Hamming weights of cyclic codes
• Considerate ramp secret sharing
• An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
• Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
• On the support weight distributions of relative subcodes of some classes of codes
• On the second relative greedy weight
• The weight hierarchy of decreasing norm-trace codes
• Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
• Bounds for generalized Hamming weights of general AG codes

This page was built for publication: Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes

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