The non-gap sequence of a subcode of a generalized Reed-Solomon code
From MaRDI portal
Publication:1934242
DOI10.1007/s10623-012-9694-2zbMath1263.94039OpenAlexW2126075688MaRDI QIDQ1934242
Edgar Martínez-Moro, Irene Márquez-Corbella, Pellikaan, Ruud
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9694-2
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (7)
The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ The properties and the error-correcting pair for lengthened GRS codes ⋮ On the unique representation of very strong algebraic geometry codes ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Quantum-assisted QD-CFS signatures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distance bounds for algebraic geometric codes
- On the order bounds for one-point AG codes
- Algebraic function fields and codes
- A lower bound for the number of solutions of equations over finite fields
- How to mask the structure of codes for a cryptographic use
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Grover vs. McEliece
- Code-based cryptography
- New directions in cryptography
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Public Key Cryptography - PKC 2006
This page was built for publication: The non-gap sequence of a subcode of a generalized Reed-Solomon code
