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
From MaRDI portal
Publication:1885299
DOI10.1007/s00605-003-0044-3zbMath1112.05017OpenAlexW2162194912MaRDI QIDQ1885299
Publication date: 28 October 2004
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-003-0044-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (5)
The cardinality of sets of \(k\)-independent vectors over finite fields ⋮ Mutually orthogonal frequency rectangles ⋮ Authenticated garbling from simple correlations ⋮ On proper secrets, \((t,k)\)-bases and linear codes ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
This page was built for publication: 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
