On a condition equivalent to the Maximum Distance Separable conjecture
Abstract
We denote by Pq the vector space of functions from a finite field Fq to itself, which can be represented as the space Pq := Fq[x]/(xq-x) of polynomial functions. We denote by On ⊂ Pq the set of polynomials that are either the zero polynomial, or have at most n distinct roots in Fq. Given two subspaces Y,Z of Pq, we denote by Y,Z their span. We prove that the following are equivalent. A) Let k, q integers, with q a prime power and 2 ≤ k ≤ q. Suppose that either: 1) q is odd 2) q is even and k ∈ \3, q-1\. Then there do not exist distinct subspaces Y and Z of Pq such that: 1') dim( Y, Z ) = k 2') dim(Y) = dim(Z) = k-1. 3') Y, Z ⊂ Ok-1 4') Y, Z ⊂ Ok-2 5') Y Z ⊂ Ok-3. B) The MDS conjecture is true for the given (q,k).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.