The cardinality of sets of k-independent vectors over finite fields

DOI10.1007/S00605-006-0440-6MaRDI QIDQ2385075zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 11 October 2007

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00605-006-0440-6

zbMATH Keywords

boundscombinatorial designsfinite fieldslinear codesLinear independence

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Review text

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.

Recommendations

• Explicit construction of exponential sized families of k-independent sets
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On independent sets
• Large sets of nearly orthogonal vectors

Cites work

• A new series of dense graphs of high girth
• The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo \((t,m,s)\)-nets and linear codes

Cited in

(11)

• A combinatorial problem for vector spaces over finite fields
• The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo \((t,m,s)\)-nets and linear codes
• A construction of maximal linearly independent array
• Row-column factorial designs with strength at least 2
• On independent sets
• The functional characteristic of maximal 3 linearly independent array
• Mutually orthogonal frequency rectangles
• Authenticated garbling from simple correlations
• On the maximum size of ultrametric orthogonal sets over discrete valued fields
• Counting problems for orthogonal sets and sublattices in function fields
• On proper secrets, (t,k)-bases and linear codes

This page was built for publication: The cardinality of sets of \(k\)-independent vectors over finite fields

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