Generalized hashing and parent-identifying codes.

DOI10.1016/J.JCTA.2003.08.001zbMath1036.94015OpenAlexW1992185324MaRDI QIDQ1417959

Noga Alon, Michael Krivelevich, Gérard D. Cohen, Simon N. Litsyn

Publication date: 6 January 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2003.08.001

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Bounds on codes (94B65) Other types of codes (94B60)

Related Items (14)

Strongly separable codes ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ The parameterized complexity of unique coverage and its variants ⋮ Separation and Witnesses ⋮ Detecting arrays for effects of single factors ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ On non-binary traceability set systems ⋮ A bound on the size of separating hash families ⋮ Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions ⋮ The Budgeted Unique Coverage Problem and Color-Coding ⋮ A class of I.P.P. codes with efficient identification ⋮ Linear time algorithms for finding a dominating set of fixed size in degenerated graphs ⋮ Yet another variation on minimal linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for perfect hashing via information theory
• On codes with the identifiable parent property
• An upper bound on the size of a code with the \(k\)-identifiable parent property
• A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Modular curves and codes with a polynomial construction
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Fredman–Komlós bounds and information theory
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Perfect Hashing and Probability
• Combinatorial properties of frameproof and traceability codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• Collusion-secure fingerprinting for digital data
• Parent-identifying codes

This page was built for publication: Generalized hashing and parent-identifying codes.