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

From MaRDI portal
Publication:2428716

DOI10.4171/JEMS/316zbMath1241.15002OpenAlexW2041788275MaRDI QIDQ2428716

Simeon Ball

Publication date: 20 April 2012

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/jems/316




Related Items (55)

On the non-existence of extended 1-perfect codes and MDS codesNew families of self-dual codesOn the subspace choosability in graphsClassification of MDS Codes over Small AlphabetsFurther results on the classification of MDS codesOn the dimension of ideals in group algebras, and group codesPlanar arcsThe construction of circulant matrices related to MDS matricesClones in matroids representable over a prime fieldNew MDS self-dual codes over finite fields of odd characteristicThe truncated and supplemented Pascal matrix and applicationsA characterization of optimal locally repairable codesIdeal ramp schemes and related combinatorial objectsMutually orthogonal frequency rectanglesLocal orthogonality dimensionNear MDS codes of non-elliptic-curve type from Reed-Solomon codesQuantum error-correcting codes and their geometriesCounting generalized Reed-Solomon codesNew upper bounds and constructions of multi-erasure locally recoverable codesNew MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codesNew classes of NMDS codes with dimension 3Doubly and triply extended MSRD codesOn additive MDS codes over small fieldsRational points on complete symmetric hypersurfaces over finite fieldsBounds in the Lee metric and optimal codesNear-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)Some new classes of additive MDS and almost MDS codes over finite fields\(d\)-wise generation of prosolvable groups.Galois geometries and coding theoryUnnamed ItemOn sets of vectors of a finite vector space in which every subset of basis size is a basis. IIGrassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codesThe lemma of tangents reformulatedThe uncertainty principle over finite fieldsBent vectorial functions and linear codes from o-polynomialsExtending small arcs to large arcsHierarchical erasure correction of linear codesOn the sharpness of Bruen's bound for intersection sets in Desarguesian affine spacesOn maximum Lee distance codesCyclic flats of binary matroidsA note on full weight spectrum codesInclusion matrices and the MDS conjectureEuclidean and Hermitian LCD MDS codesMDS codes in Doob graphsOn Segre's lemma of tangentsArcs and tensorsOpen problems in finite projective spacesOn sets of points with few odd secantsOn the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codesPURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATIONOn varieties defined by large sets of quadrics and their application to error-correcting codesMDS linear codes with one-dimensional hullCodes for Distributed StorageAn improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\)On Arcs and Quadrics



Cites Work


This page was built for publication: On sets of vectors of a finite vector space in which every subset of basis size is a basis