Coverings by rook domains
From MaRDI portal
Publication:5623698
DOI10.1016/S0021-9800(70)80018-7zbMath0219.05013MaRDI QIDQ5623698
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Orthogonal arrays, Latin squares, Room squares (05B15) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)
Related Items (13)
The football pool problem for 6 matches: A new upper bound obtained by simulated annealing ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ On maximal partial Latin hypercubes ⋮ Blocker sets, orthogonal arrays and their application to combination locks ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Hyper-rook Domain Inequalities ⋮ Lower bounds on covering codes via partition matrices ⋮ On apolarity and generic canonical forms ⋮ More coverings by rook domains ⋮ Bounds for covering codes over large alphabets ⋮ On codes with covering radius 1 and minimum distance 2 ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks ⋮ On covering and coloring problems for rook domains
This page was built for publication: Coverings by rook domains
