Relative generalized Hamming weights of q-ary Reed-Muller codes

DOI10.3934/AMC.2017041MaRDI QIDQ2408282zbMATH OpenOpenAlexFDO

Authors Olav Geil, Stefano Martin

Publication date 12 October 2017

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

secret sharingrelative generalized Hamming weightdistributed storage\(q\)-ary Reed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)

Abstract: Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the information leakage [2, 24, 21, 11].

Recommendations

• Generalized Hamming weights of q-ary Reed-Muller codes
• A note on the generalized Hamming weights of Reed-Muller codes
• Relative generalized Hamming weights of cyclic codes
• Minimal codewords in Reed-Muller codes
• On the second weight of generalized Reed-Muller codes

Cites work

• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 1324022 (Why is no real title available?)
• scientific article; zbMATH DE number 682387 (Why is no real title available?)
• Bounds for generalized Hamming weights of general AG codes
• Evaluation codes from order domain theory
• Feng-Rao decoding of primary codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Locally decodable codes
• Macaulay posets
• On the efficiency of local decoding procedures for error-correcting codes
• Projective Reed-Muller codes
• Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• Relative generalized Hamming weights of cyclic codes
• Secure Computation from Random Error Correcting Codes
• Some New Characters on the Wire-Tap Channel of Type II
• The Wire-Tap Channel
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)

Cited in

(15)

• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• Higher Hamming weights for locally recoverable codes on algebraic curves
• New code equivalence based on relative generalized Hamming weights
• Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
• Relative generalized Hamming weights over Frobenius rings
• Relative generalized Hamming weights of evaluation codes
• scientific article; zbMATH DE number 1472172 (Why is no real title available?)
• Relative generalized Hamming weights of cyclic codes
• On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
• Generalized Hamming weights of affine Cartesian codes
• Further results on higher weights of codes over finite rings
• On the third greedy weight of 4-dimensional codes
• Relative generalized Hamming weights of affine Cartesian codes
• Relative generalized Hamming weights and extended weight polynomials of almost affine codes
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes

This page was built for publication: Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes

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