English

On a condition equivalent to the Maximum Distance Separable conjecture

Information Theory 2018-09-25 v3 Combinatorics math.IT

Abstract

We denote by Pq\mathcal{P}_q the vector space of functions from a finite field Fq\mathbb{F}_q to itself, which can be represented as the space Pq:=Fq[x]/(xqx)\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x) of polynomial functions. We denote by OnPq\mathcal{O}_n \subset \mathcal{P}_q the set of polynomials that are either the zero polynomial, or have at most nn distinct roots in Fq\mathbb{F}_q. Given two subspaces Y,ZY,Z of Pq\mathcal{P}_q, we denote by Y,Z\langle Y,Z \rangle their span. We prove that the following are equivalent. A) Let k,qk, q integers, with qq a prime power and 2kq2 \leq k \leq q. Suppose that either: 1) qq is odd 2) qq is even and k∉{3,q1}k \not\in \{3, q-1\}. Then there do not exist distinct subspaces YY and ZZ of Pq\mathcal{P}_q such that: 1') dim(Y,Z)=kdim(\langle Y, Z \rangle) = k 2') dim(Y)=dim(Z)=k1dim(Y) = dim(Z) = k-1. 3') Y,ZOk1\langle Y, Z \rangle \subset \mathcal{O}_{k-1} 4') Y,ZOk2Y, Z \subset \mathcal{O}_{k-2} 5') YZOk3Y\cap Z \subset \mathcal{O}_{k-3}. B) The MDS conjecture is true for the given (q,k)(q,k).

Cite

@article{arxiv.1611.02354,
  title  = {On a condition equivalent to the Maximum Distance Separable conjecture},
  author = {Jeffery Sun and Steven Damelin and Daniel Kaiser},
  journal= {arXiv preprint arXiv:1611.02354},
  year   = {2018}
}

Comments

The paper 1705.06136 is the correct version of this paper. This paper is included in 1705.06136

R2 v1 2026-06-22T16:45:02.349Z