On a condition equivalent to the Maximum Distance Separable conjecture
Information Theory
2018-09-25 v3 Combinatorics
math.IT
Abstract
We denote by the vector space of functions from a finite field to itself, which can be represented as the space of polynomial functions. We denote by the set of polynomials that are either the zero polynomial, or have at most distinct roots in . Given two subspaces of , we denote by their span. We prove that the following are equivalent. A) Let integers, with a prime power and . Suppose that either: 1) is odd 2) is even and . Then there do not exist distinct subspaces and of such that: 1') 2') . 3') 4') 5') . B) The MDS conjecture is true for the given .
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