GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES

2007 ◽  
Vol 06 (03) ◽  
pp. 403-414 ◽  
Author(s):  
MASSIMILIANO SALA
Keyword(s):  
Weight Distribution ◽  
Gröbner Basis ◽  
Cyclic Codes ◽  
Grobner Basis ◽  
Weight Distributions

Using Gröbner techniques, we can exhibit a method to get the distance and weight distribution of cyclic codes and shortened cyclic codes, improving earlier similar results for the distance of cyclic codes.

scholarly journals COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES

2010 ◽  
Vol 09 (02) ◽  
pp. 241-256 ◽  
Author(s):  
ELEONORA GUERRINI ◽  
EMMANUELA ORSINI ◽  
MASSIMILIANO SALA
Keyword(s):  
Weight Distribution ◽  
Gröbner Basis ◽  
Black Box ◽  
Distance Distribution ◽  
The Other ◽  
Brute Force ◽  
Grobner Basis ◽  
Other Hand ◽  
Closest Pair ◽  
Nonlinear Codes

The most important families of nonlinear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the code. In the black-box complexity model, the check is optimal among closest-pair algorithms. In this paper, we provide a Gröbner basis technique to compute the weight/distance distribution of any systematic nonlinear code. Also our technique outputs all closest pairs. Unlike the check, our method can be extended to work on code families.

The weight distributions of irreducible cyclic codes of length 2npm

2018 ◽  
Vol 11 (06) ◽  
pp. 1850085
Author(s):  
Monika Sangwan ◽  
Pankaj Kumar
Keyword(s):  
Finite Field ◽  
Explicit Formula ◽  
Weight Distribution ◽  
Cyclic Codes ◽  
Primitive Root ◽  
Irreducible Cyclic Codes ◽  
Weight Distributions ◽  
Primitive Root Modulo ◽  
Explicit Expressions

Let [Formula: see text] be a primitive root modulo [Formula: see text], where [Formula: see text] and [Formula: see text] are distinct odd primes. Let [Formula: see text] be a finite field. For such pair of [Formula: see text] and [Formula: see text], the explicit expressions of minimal and generating polynomials over [Formula: see text] are obtained for all irreducible cyclic codes of length [Formula: see text]. In Sec. 4, it is observed that the weight distributions of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] can be computed easily with the help of the results obtained in [P. Kumar, M. Sangwan and S. K. Arora, The weight distribution of some irreducible cyclic codes of length [Formula: see text] and [Formula: see text], Adv. Math. Commun. 9 (2015) 277–289]. An explicit formula is also given to compute the weight distributions of irreducible cyclic codes of length [Formula: see text] over [Formula: see text].

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

scholarly journals On the relation between the MXL family of algorithms and Gröbner basis algorithms

2012 ◽  
Vol 47 (8) ◽  
pp. 926-941 ◽  
Author(s):  
Martin R. Albrecht ◽  
Carlos Cid ◽  
Jean-Charles Faugère ◽  
Ludovic Perret
Keyword(s):  
Gröbner Basis ◽  
Grobner Basis
Sign in / Sign up

Export Citation Format

Share Document