On the unique representation of very strong algebraic geometry codes
From MaRDI portal
Publication:2436568
DOI10.1007/s10623-012-9758-3zbMath1312.14075OpenAlexW2140413983MaRDI QIDQ2436568
Edgar Martínez-Moro, Irene Márquez-Corbella, Pellikaan, Ruud
Publication date: 25 February 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9758-3
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Related Items (4)
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 ⋮ ECC\(^2\): error correcting code and elliptic curve based cryptosystem ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On automorphisms of geometric Goppa codes
- On the equations defining a projective curve embedded by a non-special divisor
- Determinantal rings
- On Petri's analysis of the linear system of quadrics through a canonical curve
- Petri's approach to the study of the ideal associated to a special divisor
- Equality of geometric Goppa codes and equivalence of divisors
- Minimally generating ideals of points in polynomial time using linear algebra
- Computing ideals of points
- McEliece public key cryptosystems using algebraic-geometric codes
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- How to mask the structure of codes for a cryptographic use
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Which linear codes are algebraic-geometric?
- Algebraic Function Fields and Codes
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Introduction to post-quantum cryptography
- On the edge-independence number and edge-covering number for regular graphs
- Fundamentals of Error-Correcting Codes
- On the decoding of algebraic-geometric codes
- Existence results for rational normal curves
- Ideals of curves given by points
- Isogonal Conjugates: A new approach to certain Geometrical Theorems and to a General Theory of Conics
- Public Key Cryptography - PKC 2006
This page was built for publication: On the unique representation of very strong algebraic geometry codes
