A simple construction of cover-free (s,ℓ)-code with certain constant weight

2016/05/22 by A.G. D'yachkov, A. G. D'yachkov, Ilya Vorobyev +8
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT

paper · pdf · doi:10.48550/arxiv.1605.06847

2 pages

arxiv created 2016/05/22 · openalex publication_date 2016/05/22 · arxiv updated 2016/05/24 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We give a method of constructing a cover-free (s, ℓ)-code. For k > s, our construction yields a n \choose s \choose ℓ× n \choose k cover-free (s, ℓ)-code with a constant column weight.

Related

• Almost Cover-Free Codes and Designs
• Bounds on the rate of disjunctive codes (in Russian)
• Almost Optimal Cover-Free Families
• Covering Codes using Insertions or Deletions
• Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT