Minimal codewords in Norm-Trace codes
Daniele Bartoli, Matteo Bonini, Marco Timpanella

TL;DR
This paper studies the minimal codewords in Norm-Trace codes, focusing on their weight distribution and algebraic structure using algebraic geometry techniques to analyze the irreducibility of related varieties.
Contribution
It introduces a geometric approach to analyze minimal codewords in Norm-Trace codes, providing new insights into their weight distribution and algebraic properties.
Findings
Characterization of minimal codewords in Norm-Trace codes
Analysis of weight distribution using algebraic geometry
Identification of conditions for absolute irreducibility
Abstract
In this paper, we consider the affine variety codes obtained evaluating the polynomials , , at the affine -rational points of the Norm-Trace curve. In particular, we investigate the weight distribution and the set of minimal codewords. Our approach, which uses tools of algebraic geometry, is based on the study of the absolutely irreducibility of certain algebraic varieties.
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 · Bioactive Compounds in Plants · Cancer Mechanisms and Therapy
