2000 character limit reached
A simple construction of cover-free $(s,\ell)$-code with certain constant weight
Published 22 May 2016 in cs.IT and math.IT | (1605.06847v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.