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.15002MaRDI QIDQ2428716
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
rank; vector space; Reed-Solomon codes; arcs; basis; maximum distance separable codes; uniform matroids
94B05: Linear codes (general theory)
51E21: Blocking sets, ovals, (k)-arcs
05B35: Combinatorial aspects of matroids and geometric lattices
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Unnamed Item, On the dimension of ideals in group algebras, and group codes, The construction of circulant matrices related to MDS matrices, A note on full weight spectrum codes, On sets of points with few odd secants, On Arcs and Quadrics, Codes for Distributed Storage, Further results on the classification of MDS codes, On sets of vectors of a finite vector space in which every subset of basis size is a basis. II, Bent vectorial functions and linear codes from o-polynomials, The lemma of tangents reformulated, Inclusion matrices and the MDS conjecture, On varieties defined by large sets of quadrics and their application to error-correcting codes, New families of self-dual codes, Galois geometries and coding theory, Planar arcs, The truncated and supplemented Pascal matrix and applications, Ideal ramp schemes and related combinatorial objects, Counting generalized Reed-Solomon codes, Extending small arcs to large arcs, Euclidean and Hermitian LCD MDS codes, On Segre's lemma of tangents, \(d\)-wise generation of prosolvable groups., Hierarchical erasure correction of linear codes, Cyclic flats of binary matroids, MDS linear codes with one-dimensional hull, An improved upper bound on self-dual codes over finite fields \(\mathrm{GF}(11)\), \(\mathrm{GF}(19)\), and \(\mathrm{GF}(23)\), On the non-existence of extended 1-perfect codes and MDS codes, On the subspace choosability in graphs, New MDS self-dual codes over finite fields of odd characteristic, Rational points on complete symmetric hypersurfaces over finite fields, The uncertainty principle over finite fields, On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces, On maximum Lee distance codes, MDS codes in Doob graphs, Arcs and tensors, On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes, Clones in matroids representable over a prime field, Open problems in finite projective spaces, PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION, Classification of MDS Codes over Small Alphabets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions
- On the maximality of linear codes
- The non-classical 10-arc of PG(4,9)
- \(\alpha\)-flocks and hyperovals
- Flocks and ovals
- An elementary proof and an extension of Thas' theorem on k-arcs
- A unified construction of finite geometries associated with q-clans in characteristic 2
- Orthogonal Arrays of Index Unity
