On the subfield subcodes of Hermitian codes
DOI10.1007/s10623-012-9736-9zbMath1331.94084MaRDI QIDQ2436577
Fernando L. Piñero, Heeralal Janwa
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-9736-9
Gröbner basis; algebraic geometry codes; Hermitian codes; subfield subcodes; decoding subfield subcodes; list-decoding of subfield subcodes
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
94B60: Other types of codes
14G50: Applications to coding theory and cryptography of arithmetic geometry
14H05: Algebraic functions and function fields in algebraic geometry
05E40: Combinatorial aspects of commutative algebra
Related Items
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
- Decoding affine variety codes using Gröbner bases
- On codes from norm-trace curves
- A course in error-correcting codes.
- McEliece public key cryptosystems using algebraic-geometric codes
- On the dimension of subfield subcodes
- Gröbner Bases, Coding, and Cryptography
- Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases
- A note on Hermitian codes over GF(q/sup 2/)
- Fast decoding of codes from algebraic plane curves
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Footprints or generalized Bezout's theorem
- Complexity Reduction of Constant Matrix Computations over the Binary Field