AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional subspaces of V required to cover the nonzero points of V is established. This is done by first regarding V as a field extension of F and then associating with each coset L of a subspace of V a polynomial whose roots are the points of L. A covering with cosets is then equivalent to a product of such polynomials having the minimal polynomial satisfied by all nonzero points of V as a factor
Abstract. We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractThe enumeration of points on (or off) the union of some linear or affine subspaces over a fi...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
Abstract. We answer a question by Niederreiter concerning the enumeration of a class of subspaces of...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
AbstractBurde's theory about p-dimensionalvectorsmodulop (J. Reine Angew. Math. 268/269 (1974) 302–3...
Abstract. We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractThe enumeration of points on (or off) the union of some linear or affine subspaces over a fi...
AbstractIf V is a vector space over a finite field F, the minimum number of cosets of k-dimensional ...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractIn this note, we find a sharp bound for the minimal number (or in general, indexing set) of ...
AbstractLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
14 pagesLet k be a field. We are interested in the families of r-dimensional subspaces of kn with th...
Abstract. We answer a question by Niederreiter concerning the enumeration of a class of subspaces of...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
AbstractBurde's theory about p-dimensionalvectorsmodulop (J. Reine Angew. Math. 268/269 (1974) 302–3...
Abstract. We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration...
AbstractWe study the question how many subgroups, cosets or subspaces are needed to cover a finite A...
AbstractThe enumeration of points on (or off) the union of some linear or affine subspaces over a fi...