English

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

Information Theory 2016-05-24 v1 math.IT

Abstract

We give a method of constructing a cover-free (s,)(s, \ell)-code. For k>sk > s, our construction yields a ((ns))×(nk) {{n \choose s} \choose \ell}\times {n \choose k} cover-free (s,)(s, \ell)-code with a constant column weight.

Keywords

Cite

@article{arxiv.1605.06847,
  title  = {A simple construction of cover-free $(s,\ell)$-code with certain constant weight},
  author = {A. G. D'yachkov and I. V. Vorobyev and N. A. Polyanskii and V. Yu. Shchukin},
  journal= {arXiv preprint arXiv:1605.06847},
  year   = {2016}
}

Comments

2 pages