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

DOI10.3934/AMC.2017041zbMATH Open1418.94073arXiv1407.6185OpenAlexW2963875179MaRDI QIDQ2408282FDOQ2408282

Authors: Olav Geil, Stefano Martin 

Publication date: 12 October 2017

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

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].

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

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

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)

Cites Work

• Generalized Hamming weights for linear codes
• Projective Reed-Muller codes
• Title not available (Why is that?)
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• Some New Characters on the Wire-Tap Channel of Type II
• Generalized Hamming weights of q-ary Reed-Muller codes
• Secure Computation from Random Error Correcting Codes
• Title not available (Why is that?)
• Bounds for generalized Hamming weights of general AG codes
• Feng-Rao decoding of primary codes
• Evaluation codes from order domain theory
• 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)\)
• Macaulay posets
• Relative generalized Hamming weights of cyclic codes
• On the efficiency of local decoding procedures for error-correcting codes
• Locally decodable codes
• Title not available (Why is that?)
• Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower

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 of evaluation codes
• Relative generalized Hamming weights over Frobenius rings
• Title not available (Why is that?)
• 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)