Relative generalized Hamming weights of one-point algebraic geometric codes
arXiv:1403.7985 · doi:10.1109/TIT.2014.2345375
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.
References in corpus (4)
Cited by in corpus (16)
- Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
- Improved constructions of nested code pairs
- Higher Hamming weights for locally recoverable codes on algebraic curves
- On asymptotically good ramp secret sharing schemes
- Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Hermitian codes and complete intersections
- Relative generalized Hamming weights of evaluation codes
- Relative generalized Hamming weights of q-ary Reed-Muller codes
- Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
- On nested code pairs from the Hermitian curve
- On the similarities between generalized rank and Hamming weights and their applications to network coding
- Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
- Relative Generalized Hamming Weights of Cyclic Codes
- Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
- Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Multicomputers