On codes with the identifiable parent property
From MaRDI portal
Publication:1268617
DOI10.1006/jcta.1997.2851zbMath0910.05070OpenAlexW1970997983WikidataQ106166318 ScholiaQ106166318MaRDI QIDQ1268617
Henk D. L. Hollmann, J. H. van Lint, Jean-Paul M. G. Linnartz, L. M. G. M. Tolhuizen
Publication date: 12 April 1999
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1997.2851
Related Items (49)
An upper bound on the size of a code with the \(k\)-identifiable parent property ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ On optimal codes with \(w\)-identifiable parent property ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection ⋮ Codes for copyright protection: the case of two pirates ⋮ Jack van Lint (1932--2004): a survey of his scientific work ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Unnamed Item ⋮ Separation and Witnesses ⋮ Equal-Weight Fingerprinting Codes ⋮ Improved bounds for separating hash families ⋮ Multimedia IPP codes with efficient tracing ⋮ Tracing a linear subspace: application to linearly-homomorphic group signatures ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Tracing quantum state distinguishers via backtracking ⋮ On non-binary traceability set systems ⋮ Bounds for separating hash families ⋮ Optimal 2-traceability codes of length 4 ⋮ Generalized hashing and parent-identifying codes. ⋮ Traceability codes ⋮ On codes with \(w\)-identifiable parent property ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ Maximum IPP codes of length 3 ⋮ Some intriguing upper bounds for separating hash families ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ False negative probabilities in Tardos codes ⋮ On traceability property of equidistant codes ⋮ Asymptotically optimal \(\overline {2}\)-separable codes with length 4 ⋮ On generalized separating hash families ⋮ 2-secure codes from 2-SFP codes ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Binary fingerprinting codes ⋮ Parent-identifying codes ⋮ New constructions for IPP codes ⋮ Separable collusion-secure multimedia codes ⋮ Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes ⋮ Traitors Collaborating in Public: Pirates 2.0 ⋮ Intersecting codes and separating codes ⋮ A class of I.P.P. codes with efficient identification ⋮ Perfect hash families: Probabilistic methods and explicit constructions ⋮ Codes with the identifiable parent property and the multiple–access channel ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
Cites Work
This page was built for publication: On codes with the identifiable parent property
