The basics of bases
From MaRDI portal
Publication:2431396
Assume that the spanning set \(T\) of a \(k\) dimensional vector space \(V\) over a field consists of \(t\) vectors. Let \(f(T)\) be the number of bases of \(V\) in \(T\) (i.e. \(1\leq f(T) \leq \binom{t}{k}).\) The authors find the best possible lower bound of \(f(T)\). They apply this bound to determine the number of triangles in an arbitrary (spanning) set of points in the projective plane. The lower bound is also applied to determine the number of information sets of a projective linear code.
Recommendations
- Additive bases of vector spaces over prime fields
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- scientific article; zbMATH DE number 4029587
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On proper secrets, (t,k)-bases and linear codes
Cites work
- At the dawn of the theory of codes
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 2132175 (Why is no real title available?)
- scientific article; zbMATH DE number 3155241 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 781454 (Why is no real title available?)
- Linear algebra gems. Assets for undergraduate mathematics
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- Polynomial Codes Over Certain Finite Fields
- The Non-Existence of Finite Projective Planes of Order 10
This page was built for publication: The basics of bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431396)
