Back to Search
Start Over
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes<xref ref-type="fn" rid="fn1">1</xref><fn id="fn1"><label>1</label><p>The paper is registered to the ORCID of Olav Geil. For more details please visit ...
- Source :
- IEEE Transactions on Information Theory; Oct2014, Vol. 60 Issue 10, p5938-5949, 12p
- Publication Year :
- 2014
-
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 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- HAMMING codes
CODING theory
ALGEBRAIC geometric codes
LINEAR codes
CRYPTOGRAPHY
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 60
- Issue :
- 10
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 98237009
- Full Text :
- https://doi.org/10.1109/TIT.2014.2345375