Secure Frameproof Code Through Biclique Cover

zbMath1283.68270arXiv1202.1889MaRDI QIDQ5403039

Hossein Hajiabolhassan, Farokhlagha Moazami

Publication date: 25 March 2014

Full work available at URL: https://arxiv.org/abs/1202.1889

zbMATH Keywords

Hadamard matrixsecure frameproof codecover-free familybiclique cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The rectangle covering number of random Boolean matrices, Upper bounds on the Boolean rank of Kronecker products, On the biclique cover of the complete graph, Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract), Biclique cover and local clique cover of graphs