On sets of vectors of a finite vector space in which every subset of basis size is a basis II

preprint2012arXivOpen access

Abstract

This article contains a proof of the MDS conjecture for k≤2p−2k \leq 2p-2. That is, that if SS is a set of vectors of Fqk{\mathbb F}_q^k in which every subset of SS of size kk is a basis, where q=phq=p^h, pp is prime and qq is not and k≤2p−2k \leq 2p-2, then ∣S∣≤q+1|S| \leq q+1. It also contains a short proof of the same fact for k≤pk\leq p, for all qq.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.