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

preprint2016arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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