Algebraic-geometric codes with many automorphisms arising from Galois points
Satoru Fukasawa

TL;DR
This paper introduces a new method for constructing algebraic-geometric codes that have a high number of automorphisms, utilizing Galois points on algebraic curves to enhance code symmetry.
Contribution
The paper presents a novel construction technique for algebraic-geometric codes leveraging Galois points to increase automorphism groups.
Findings
Codes with enhanced automorphism groups were successfully constructed.
The method demonstrates potential for improved code symmetry and decoding efficiency.
The approach broadens the class of algebraic-geometric codes with rich automorphism structures.
Abstract
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography
