A Graham-Sloane type construction for s-surjective matrices

DOI10.1023/A:1022490600755MaRDI QIDQ685994zbMATH OpenFDO

Authors Iiro Honkala

Publication date 15 May 1994

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

orthogonal arrayadditive basis\(s\)-surjective matrix

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• On generalized surjective codes
• On \(n\)-column 0,1-matrices with all \(k\)-projections surjective
• Sign-balanced covering matrices
• Surjectivity of near-square random matrices
• Sparse Parity-Check Matrices over ${GF(q)}$

Cites work

• scientific article; zbMATH DE number 3943824 (Why is no real title available?)
• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• scientific article; zbMATH DE number 45817 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3227181 (Why is no real title available?)
• A lower bound for<tex>A(n,4,w)</tex>(Corresp.)
• A new table of constant weight codes
• Applications of coding theory to communication combinatorial problems
• Covering radius---Survey and recent results
• Explicit construction of exponential sized families of k-independent sets
• Families of \(k\)-independent sets
• Lower bounds for constant weight codes
• Modified bounds for covering codes
• On the covering radius of codes
• Zu einer Vermutung von Rohrbach.

Cited in

(1)

• Bounds for covering codes over large alphabets

This page was built for publication: A Graham-Sloane type construction for \(s\)-surjective matrices

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