Small-weight codewords of algebraic geometry codes
The main topic of this paper is to present and use particular techniques to find weight distribution of algebraic geometric codes from curves, also called Goppa codes. The techniques used are inspired by [\textit{E. Ballico}, Sarajevo J. Math. 10(23), No. 2, 141--154 (2014; Zbl 1317.14116); \textit{E. Ballico} and \textit{A. Ravagnani}, J. Algebra 397, 499--514 (2014; Zbl 1343.94099); ``On the geometry of Hermitian two-point codes, Finite Fields Appl. 30, 51--62 (2014); J. Commut. Algebra 7, No. 2, 149--166 (2015; Zbl 1327.14116); ``A zero-dimensional cohomological approach to Hermitian codes, Des. Codes Crypt. 79, No. 1, 75--89 (2016); \textit{E. Ballico}, Afr. Mat. 27, No. 5--6, 1003--1020 (2016; Zbl 1358.94102); \textit{E. Ballico} and \textit{C. Marcolla}, Finite Fields Appl. 40, 61--72 (2016; Zbl 1409.94941); \textit{E. Ballico} and \textit{A. Ravagnani}, Appl. Algebra Eng. Commun. Comput. 24, No. 5, 343--354 (2013; Zbl 1347.94077); \textit{E. Ballico} and \textit{A. Ravagnani}, Finite Fields Appl. 20, 30--39 (2013; Zbl 1308.94112)]. One studies both codes obtained by evaluating homogeneous forms, and codes obtained by evaluation members of Riemann-Roch-spaces at given points on an algebraic curve.\N\NThe paper consists of 5 sections. In the introduction one explains the background and purpose of the paper. In Section 2 one presents general facts about linear error-correcting codes and the q-ary symmetric channel. In particular one focuses on probabilities of undetected errors and presents a result where one shows how such a probability is determined by the weight distribution of the code. In Section 3 one gives the definition and describes well-known properties of algebraic geometry codes from curves. One also gives a result which tells how supports and weights of codewords can be found using cohomological properties of certain ideal sheaves on \(\mathbb{P}^2\) in the case where the curve that is used to produce the code is a plane, projective one.\N\NIn Section 4 one focuses on Hermitian curves and gives a result describing cohomological properties of twists of ideal sheaves on the curve.\N\NIn Section 5 the main results are given. These are theorems where one describes the weight distributions of one-point and two-point codes that are constructed using Hermitian curves. One also gives a result describing minimum weight codewords of one-point-codes obtained from norm-trace curves.
- A comparison between Suzuki invariant code and one-point Hermitian code
- Algebraic curves over a finite field
- Algebraic Function Fields and Codes
- Algebraic geometry codes and some appliations
- Algebraic Soft-Decision Decoding of Hermitian Codes
- Decoding of Hermitian codes: the key equation and efficient error evaluation
- Equality of geometric Goppa codes and equivalence of divisors
- Error detecting and error correcting codes
- Fundamentals of Error-Correcting Codes
- Goppa codes
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety
- Higher Hamming weights for locally recoverable codes on algebraic curves
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- scientific article; zbMATH DE number 3480475 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 1512349 (Why is no real title available?)
- scientific article; zbMATH DE number 3803619 (Why is no real title available?)
- Improved Two-Point Codes on Hermitian Curves
- Intersections between the norm-trace curve and some low degree curves
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes on algebraic curves
- Minimum distance of Hermitian two-point codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- On codes from norm-trace curves
- On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve
- On the duals of geometric Goppa codes from norm-trace curves
- On the geometry of Hermitian one-point codes
- On the Hermitian curve and its intersections with some conics
- On the inherent intractability of certain coding problems (Corresp.)
- Post-Quantum Cryptography
- Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences
- The complete determination of the minimum distance of two-point codes on a Hermitian curve
- The dual minimum distance of arbitrary-dimensional algebraic-geometric codes
- The two-point codes on a Hermitian curve with the designed minimum distance
- Toward the determination of the minimum distance of two-point codes on a Hermitian curve.
- Two-Point Codes on Norm-Trace Curves
- Zero-dimensional schemes in the plane
This page was built for publication: Small-weight codewords of algebraic geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939746)
