A Graham-Sloane type construction for s-surjective matrices

DOI10.1023/A:1022490600755zbMATH Open0788.05012MaRDI QIDQ685994FDOQ685994

Authors: Iiro Honkala 

Publication date: 15 May 1994

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

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)}$

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)

Cites Work

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

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)