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

DOI10.1007/BF01141782zbMATH Open0627.05018OpenAlexW2045132984MaRDI QIDQ581409FDOQ581409

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)

Cites Work

• Title not available (Why is that?)
• On coverings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal coverings of pairs by triples
• Maximal and minimal coverings of (k - 1)-tuples by k-tuples
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• The packing problem in statistics, coding theory and finite projective spaces
• The application of coding theory to the design of combinatorial filing schemes of any order
• On the difference between asymptotically good packings and coverings

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)