Generalized hashing and parent-identifying codes.
type: Item
instance of: scholarly article
title: Generalized hashing and parent-identifying codes.
zbMATH Open document ID: 1036.94015
author: Noga Alon
author: Michael Krivelevich
author: Gérard Cohen
author: Simon Litsyn
published in: Journal of Combinatorial Theory. Series A
publication date: 2004-01-06T00:00:00Z
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 2022052
MaRDI profile type: Publication
full work available at URL: j.jcta.2003.08.001
OpenAlex ID: W1992185324
cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
cites work: Parent-identifying codes
cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
cites work: A hypergraph approach to the identifying parent property: The case of multiple parents
cites work: An upper bound on the size of a code with the \(k\)-identifiable parent property
cites work: Collusion-secure fingerprinting for digital data
cites work: Q4940701
cites work: Q3619797
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: On codes with the identifiable parent property
cites work: Modular curves and codes with a polynomial construction
cites work: Fredman–Komlós bounds and information theory
cites work: New bounds for perfect hashing via information theory
cites work: Q4146667
cites work: Perfect Hashing and Probability
cites work: Combinatorial properties of frameproof and traceability codes
cites work: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
DOI: 10.1016/J.JCTA.2003.08.001
description: scientific article; zbMATH DE number 2022052