Generalized AG codes as evaluation codes
Marco Calderini, Massimiliano Sala
TL;DR
This paper extends the construction of GAG codes to evaluation codes, estimates their minimum distance, and explores their connection to one-point GAG codes, broadening the understanding of algebraic geometric codes.
Contribution
It introduces a generalized construction of GAG codes as evaluation codes and analyzes their properties, including minimum distance and relation to existing codes.
Findings
Extended GAG codes as evaluation codes with estimated minimum distance
Established connection between generalized evaluation codes and one-point GAG codes
Broadened the theoretical framework of algebraic geometric codes
Abstract
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
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 · graph theory and CDMA systems · Algorithms and Data Compression