On covering and coloring problems for rook domains

DOI10.1016/0012-365X(85)90152-9zbMath0589.05029MaRDI QIDQ1073803

Walter Alexandre Carnielli

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamming distancecovering setcoloring problemcovering problemrook domain

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40)

Related Items (12)

A covering problem over finite rings ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Invariant sets under linear operator and covering codes over modules ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Short covering codes arising from matchings in weighted graphs ⋮ Bounds for short covering codes and reactive tabu search ⋮ Hyper-rook Domain Inequalities ⋮ A connection between sumsets and covering codes of a module ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space ⋮ Invariant sets under permutation, extremal graphs, and covering codes

Cites Work

• Unnamed Item
• The football pool problem for 5 matches
• Intersection Inequalities for the Covering Problem
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Coverings by rook domains
• Rook domains, Latin squares, affine planes, and error-distributing codes
• Maximum distance<tex>q</tex>-nary codes
• Covering Problems Concerning Abelian Groups
• Covering problems for dichotomized matchings

This page was built for publication: On covering and coloring problems for rook domains