A combinatorial problem for vector spaces over finite fields

DOI10.1016/0012-365X(91)90315-SzbMath0747.11063OpenAlexW1965656255MaRDI QIDQ1185082

Harald Niederreiter

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90315-s

zbMATH Keywords

finite fieldslinear dependencecoding theoryvector spaces

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Finite fields and commutative rings (number-theoretic aspects) (11T99) Arithmetic codes (94B40)

Related Items (26)

Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Weight distribution of the crown-weight space ⋮ Codes with a poset metric ⋮ Matrix-product constructions of digital nets ⋮ Combinatorial methods in the construction of point sets with uniformity properties ⋮ Linear codes on posets with extension property ⋮ Block codes in pomset metric over \(\mathbb{Z}_m\) ⋮ Niederreiter-Rosenbloom-Tsfasman LCD codes ⋮ Codes with respect to weighted poset block metric ⋮ Unnamed Item ⋮ MacWilliams extension theorems and the local-global property for codes over Frobenius rings ⋮ Wei-type duality theorems for matroids ⋮ Groups of linear isometries on poset structures ⋮ Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes ⋮ Point sets with uniformity properties and orthogonal hypercubes ⋮ The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces ⋮ Maximum distance separable poset codes ⋮ Symmetry groups of Rosenbloom-Tsfasman spaces ⋮ MDS and \(I\)-perfect poset block codes ⋮ Wei-type duality theorems for rank metric codes ⋮ On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ Low-discrepancy point sets obtained by digital constructions over finite fields ⋮ Automorphism group of the crown-weight space ⋮ Factorization of polynomials and some linear-algebra problems over finite fields ⋮ Fourier-reflexive partitions and MacWilliams identities for additive codes

Cites Work

• Point sets and sequences with small discrepancy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial problem for vector spaces over finite fields