On 2-parent-identifying set systems of block size 4

From MaRDI portal



Abstract: Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks I2(n,4) in a 2-parent-identifying set system with ground set size n and block size 4. The previous best known lower bound states that I2(n,4)=Omega(n4/3+o(1)). We improve this lower bound by showing that I2(n,4)=Omega(n3/2−o(1)) using techniques in additive number theory.












This page was built for publication: On 2-parent-identifying set systems of block size 4

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