Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints

Date

2017-08-31

Author

GEİL, Olav
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

140
views

0
downloads

We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in [12, Example 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to [9] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound [7,10] from Grobner basis theory and for this purpose we develop a new method where we inspired by Buchbergers algorithm perform a series of symbolic computations.

Subject Keywords

Affine variety codes, Buchberger's algorithm, Klein curve, Minimum distance

URI

https://hdl.handle.net/11511/49302

DOI

https://doi.org/10.1007/978-3-319-66278-7_12

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

On affine variety codes from the Klein quartic Geil, Olav; Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-03-01) We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433-464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and HOholdt, IEEE Trans. Inform. The...
The Minimum Hamming Distance of Cyclic Codes of Length 2ps ÖZADAM, Hakan; Özbudak, Ferruh (2009-06-12) We study cyclic codes of length 2p(s) over F-q where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.
Constructing codes from algebraic curves Özbudak, Ferruh (1999-11-01) We discuss some recent constructions of codes from algebraic curves due to Xing, Niederreiter, and Lam, and we investigate their relations with Goppa's algebraic-geometric codes.
Low-power and area-efficient finite field arithmetic architecture based on irreducible all-one polynomials Mohaghegh, Shima; Muhtaroğlu, Ali; Electrical and Electronics Engineering (2020-9) This thesis presents a low-power and area-efficient finite field multiplier based on irreducible all-one polynomials (AOP). The proposed organization implements the AOP multiplication algorithm in three stages, which are reduction network, AND network (multiplication), and three input XOR tree (accumulation), while state-of-the-art implementations distribute reduction, multiplication and accumulation operations in a systolic array. The optimization reduces the overall number of sequential elements and provi...
Repeated - root cyclic codes and matrix product codes Özadam, Hakan; Özbudak, Ferruh; Department of Cryptography (2012) We study the Hamming distance and the structure of repeated-root cyclic codes, and their generalizations to constacyclic and polycyclic codes, over finite fields and Galois rings. We develop a method to compute the Hamming distance of these codes. Our computation gives the Hamming distance of constacyclic codes of length $np^s$\ in many cases. In particular, we determine the Hamming distance of all constacyclic, and therefore cyclic and negacyclic, codes of lengths p^s and 2p^s over a finite field of charac...

Citation Formats

O. GEİL and F. Özbudak, “Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints,” 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/49302.