The cardinality of sets of \(k\)-independent vectors over finite fields (Q2385075)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5199743
Language Label Description Also known as
default for all languages
No label defined
    English
    The cardinality of sets of \(k\)-independent vectors over finite fields
    scientific article; zbMATH DE number 5199743

      Statements

      The cardinality of sets of \(k\)-independent vectors over finite fields (English)
      0 references
      0 references
      11 October 2007
      0 references
      A set of vectors of length \(n\) over the finite field of \(q\) elements is called \(k\)-independent if all its subsets of \(k\) elements are linearly independent. Denote by Ind\(_q(n,k)\) the maximal possible size of a \(k\)-independent set. In the paper under review, the authors generalize their previous result by proving that Ind\(_q(n,k)=k+1\) if and only if \(q(n+1) \leq k(q+1)\). This condition seems to promise interesting applications.
      0 references
      Linear independence
      0 references
      finite fields
      0 references
      linear codes
      0 references
      bounds
      0 references
      combinatorial designs
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references