Minimum distance of Hermitian two-point codes
Seungkook Park
TL;DR
This paper derives a formula for the minimum distance of two-point algebraic geometry codes constructed from Hermitian curves, aiding in understanding their error-correcting capabilities.
Contribution
It provides a new explicit formula for the minimum distance of two-point Hermitian codes, advancing coding theory knowledge.
Findings
Derived a formula for minimum distance of two-point Hermitian codes
Enhanced understanding of error correction in algebraic geometry codes
Potential applications in designing more efficient codes
Abstract
We prove a formula for the minimum distance of two-point codes on a Hermitian curve.
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 · graph theory and CDMA systems