A Graham-Sloane type construction for \(s\)-surjective matrices

DOI10.1023/A:1022490600755zbMath0788.05012MaRDI QIDQ685994

Iiro S. 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

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

Related Items (1)

Bounds for covering codes over large alphabets

Cites Work

• Applications of coding theory to communication combinatorial problems
• Explicit construction of exponential sized families of k-independent sets
• Families of \(k\)-independent sets
• A new table of constant weight codes
• On the covering radius of codes
• Covering radius---Survey and recent results
• Lower bounds for constant weight codes
• A lower bound for<tex>A(n,4,w)</tex>(Corresp.)
• Zu einer Vermutung von Rohrbach.
• Modified bounds for covering codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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