Skip to Main content Skip to Navigation
Conference papers

Almost Cover-Free Codes and Designs

Abstract : An s-subset of codewords of a binary code X is said to be (s,l)-bad in X if the code X contains a subset of other l codewords such that the conjunction of the l codewords is covered by the disjunctive sum of the s codewords. Otherwise, the s-subset of codewords of X is called (s,l)-good in X. A binary code X is said to be a cover-free (CF) (s,l)-code if the code X does not contain (s,l)-bad subsets. In this paper, we introduce a natural probabilistic generalization of CF (s,l)-codes, namely: a binary code X is said to be an almost CF (s,l)-code if the relative number of its (s,l)-good s-subsets is close to 1. We develop a random coding method based on the ensemble of binary constant weight codes to obtain lower bounds on the capacity of such codes. Our main result shows that the capacity for almost CF (s,l)-codes is essentially greater than the rate for ordinary CF (s,l)-codes.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Jean-Pierre Tillich <>
Submitted on : Friday, February 19, 2016 - 5:41:33 PM
Last modification on : Wednesday, September 4, 2019 - 5:36:02 PM
Long-term archiving on: : Friday, May 20, 2016 - 11:38:13 AM


Files produced by the author(s)


  • HAL Id : hal-01276693, version 1



A.G. d'Yachkov, I.V. Vorobyev, N.A. Polyanskii, V.Yu. Shchukin. Almost Cover-Free Codes and Designs. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276693⟩



Record views


Files downloads