F. Moazami

activity

20102014

most citedSecure Frameproof Code Through Biclique Cover

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012★ 1 cited

A Note on d-Biclique Covers

Farokhlagha Moazami, Nasrin Soltankhah, Shahzad Basiriz

A d-biclique cover of a graph G is a collection of bicliques of G such that each edge of G is in at least d of the bicliques. The number of bicliques in a minimum d-biclique cover…

math.CO2012★ 2 cited

Secure Frameproof Code Through Biclique Cover

Hossein Hajiabolhassan, Farokhlagha Moazami

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