Finite geometry, Algebraic curves and Applications to Coding Theory
Metrics that agree on the support of vectors and nearest neighbor decoding
Rational points and automorphisms on algebraic curves over finite fields
| Full text | |
| Author(s): |
Pace, Nicola
;
Sonnino, Angelo
Total Authors: 2
|
| Document type: | Journal article |
| Source: | DESIGNS CODES AND CRYPTOGRAPHY; v. 83, n. 1, p. 115-143, APR 2017. |
| Web of Science Citations: | 2 |
| Abstract | |
Linear codes with large automorphism groups are constructed. Most of them are suitable for permutation decoding. In some cases they are also optimal. For instance, we construct an optimal binary code of length and dimension having minimum distance and automorphism group isomorphic to . (AU) | |
| FAPESP's process: | 12/03526-0 - Finite geometry, Algebraic curves and Applications to Coding Theory |
| Grantee: | Nicola Pace |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |