Some simple consequences of coding theory for combinatorial problems of packings and coverings

DOI10.1007/BF01141782MaRDI QIDQ581409zbMATH OpenOpenAlexFDO

Authors L. A. Bassalygo, Victor A. Zinoviev

Publication date 1984

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01141782

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

The title is accurate; the authors establish a conjecture of Erdős and Hanani in one specific case.

Cites work

• scientific article; zbMATH DE number 3167429 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3628979 (Why is no real title available?)
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• Maximal and minimal coverings of (k - 1)-tuples by k-tuples
• Minimal coverings of pairs by triples
• On coverings

Cited in

(4)

• The packing problem in statistics, coding theory and finite projective spaces
• On the difference between asymptotically good packings and coverings
• scientific article; zbMATH DE number 1846851 (Why is no real title available?)
• The application of coding theory to the design of combinatorial filing schemes of any order

This page was built for publication: Some simple consequences of coding theory for combinatorial problems of packings and coverings

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