On linear codes from maximal curves
Stefania Fanali
TL;DR
This paper explores linear codes derived from maximal algebraic curves using Feng-Rao construction, demonstrating improved minimum distances over existing codes of the same length and dimension.
Contribution
It introduces new linear codes from maximal curves that outperform known codes in minimum distance, enhancing coding theory applications.
Findings
Codes have better minimum distance than previous codes
Feng-Rao construction effectively improves code parameters
Maximal curves are a valuable source for high-performance codes
Abstract
Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.
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 · Finite Group Theory Research · Digital Image Processing Techniques