On the minimal distance of a polynomial code - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

On the minimal distance of a polynomial code


For a polynomial f(x) is an element of Z(2)[x] it is natural to consider the near-ring code generated by the polynomials f circle x, f circle x(2) ,..., f circle x(k) as a vectorspace. It is a 19 year old conjecture of Gunter Pilz that for the polynomial f (x) - x(n) broken vertical bar x(n-1) broken vertical bar ... broken vertical bar x the minimal distance of this code is n. The conjecture is equivalent to the following purely number theoretical problem. Let (m) under bar = \1, 2 ,..., m\ and A subset of N be an arbitrary finite subset of N. Show that the number of products that occur odd many times in (n) under bar. A is at least n. Pilz also formulated the conjecture for the special case when A = (k) under bar. We show that for A = (k) under bar the conjecture holds and that the minimal distance of the code is at least n/(log n)(0.223). While proving the case A = (k) under bar we use different number theoretical methods depending on the size of k (respect to n). Furthermore, we apply several estimates on the distribution of primes.
Fichier principal
Vignette du fichier
2053-6596-1-PB.pdf (305.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990488 , version 1 (13-05-2014)



Peter Pal Pach, Csaba Szabo. On the minimal distance of a polynomial code. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 4 (4), pp.33--43. ⟨10.46298/dmtcs.556⟩. ⟨hal-00990488⟩


49 View
599 Download



Gmail Facebook Twitter LinkedIn More