Inclusion matrices and the MDS conjecture

zbMATH Open1351.05038arXiv1511.03623MaRDI QIDQ727207FDOQ727207

Authors: Ameera Chowdhury 

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let F_q be a finite field of order q with characteristic p. An arc is an ordered family of at least k vectors in (F_q)^k in which every subfamily of size k is a basis of (F_q)^k. The MDS conjecture, which was posed by Segre in 1955, states that if k <= q, then an arc in (F_q)^k has size at most q+1, unless q is even and k=3 or k=q-1, in which case it has size at most q+2. We propose a conjecture which would imply that the MDS conjecture is true for almost all values of k when q is odd. We prove our conjecture in two cases and thus give simpler proofs of the MDS conjecture when k <= p, and if q is not prime, for k <= 2p-2. To accomplish this, given an arc G of (F_q)^k and a nonnegative integer n, we construct a matrix M_G^{uparrow n}, which is related to an inclusion matrix, a well-studied object in combinatorics. Our main results relate algebraic properties of the matrix M_G^{uparrow n} to properties of the arc G and may provide new tools in the computational classification of large arcs.

Full work available at URL: https://arxiv.org/abs/1511.03623

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Planar arcs
• scientific article; zbMATH DE number 554072
• scientific article; zbMATH DE number 4080278
• Arcs in finite projective spaces

zbMATH Keywords

linear codesMDS conjecturesingleton bound

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Partitions of sets (05A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Orthogonal Arrays of Index Unity
• Orbits of arcs in PG\((N,K)\) under projectivities
• On MDS codes via Cauchy matrices
• Title not available (Why is that?)
• Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Curve razionali normali e \(k\)-archi negli spazi finiti
• On the embedding of an arc into a conic in a finite plane
• Finite geometry and combinatorial applications
• On MDS extensions of generalized Reed- Solomon codes
• Intersection theorems and mod \(p\) rank of inclusion matrices
• The non-classical 10-arc of PG(4,9)
• Extending small arcs to large arcs
• Title not available (Why is that?)
• An elementary proof and an extension of Thas' theorem on k-arcs

Cited In (10)

• Planar arcs
• On arcs and quadrics
• An algebraic-coding equivalence to the maximum distance separable conjecture
• A note on MDS codes, \(n\)-arcs and complete designs
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Nonstandard rank-one nonincreasing maps on symmetric matrices
• Extending small arcs to large arcs
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis

This page was built for publication: Inclusion matrices and the MDS conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727207)