Improved Lower Bounds for Secure Codes and Related Structures

arXiv2108.07987MaRDI QIDQ6375486FDOQ6375486

Xin Wang, Bingchen Qian, Gennian Ge

Publication date: 18 August 2021

Abstract: Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the main research objective. In this paper, we investigate the lower bounds for secure codes and their related structures. First, we give some improved lower bounds for the rates of $2$-frameproof codes and $overline2$-separable codes for slightly large alphabet size. Then we improve the lower bounds for the rate of some related structures, i.e., strongly $2$-separable matrices and $2$-cancellative set families. Finally, we give a general method to derive new lower bounds for strongly $t$-separable matrices and $t$-cancellative set families for $tge3.$

This page was built for publication: Improved Lower Bounds for Secure Codes and Related Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375486)