Secure Frameproof Code Through Biclique Cover

Hossein Hajiabolhassan, Farokhlagha Moazami

For a binary code $\Gamma$ of length $v$, a $v$-word $w$ produces by a set of codewords $\{w^1,...,w^r\}\subseteq \Gamma$ if for all $i=1,...,v$, we have $w_i\in \{w_i^1,...,w_i^r\}$ . We…