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

DOI10.1007/S00605-003-0044-3MaRDI QIDQ1885299zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Recommendations

• A construction of maximal linearly independent array
• Hypercubic 4 and 5-designs from double-error-correcting BCH codes
• Intersecting codes and independent families
• The cardinality of sets of \(k\)-independent vectors over finite fields
• scientific article; zbMATH DE number 5901714

Cited in

(8)

• Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
• The functional characteristic of maximal 3 linearly independent array
• On proper secrets, (t,k)-bases and linear codes
• Mutually orthogonal frequency rectangles
• Authenticated garbling from simple correlations
• On the maximum size of ultrametric orthogonal sets over discrete valued fields
• A construction of maximal linearly independent array
• The cardinality of sets of \(k\)-independent vectors over finite fields

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

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