Set graphs. II. Complexity of set graph recognition and similar problems

Autor: Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu

Publikováno v: Theoretical Computer Science. 547:70-81

A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph represen

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a18278b4e737077d15209c4ff7a6c73
https://doi.org/10.1016/j.tcs.2014.06.017

Códigos con propiedades de localización basados en matrices de bajo sesgo

Autor: Moreira, José, Fernández, Marcel, Kabatiansky, Grigory

Publikováno v: RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)

En este artículo presentamos una construcción explicita de un código con propiedades de identificación de traidores, aplicable a entornos de fingerprinting. Nuestro trabajo parte del estudio de una familia de códigos conocidos como códigos sepa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::81d0b65fb98611e2a097e6b5c6c8fa16
https://hdl.handle.net/10045/40393

Constructions of almost secure frameproof codes based on small-bias probability spaces

Autor: José Moreira, Grigory Kabatiansky, Marcel Fernandez

Publikováno v: Advances in Information and Computer Security ISBN: 9783642413827
IWSEC
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I

Secure frameproof code is the name given to a separating code when studied in relation to fingerprinting schemes. Separating codes are combinatorial objects that have found to be useful in many areas such as technical diagnosis and the protection of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f11c7bdf152417279ef838e8d6a00dd2
https://hdl.handle.net/2117/22615

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Almost separating and almost secure frameproof codes over q-ary alphabets

Autor: Marcel Fernandez, Grigory Kabatiansky, José Moreira

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-015-0060-z In this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relax

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76ae2a3d2461d0372f552aee552ed1a1
http://hdl.handle.net/2117/103432