New upper bounds for parent-identifying codes and traceability codes
type: Item
instance of: scholarly article
title: New upper bounds for parent-identifying codes and traceability codes
zbMATH Open document ID: 1402.94127
author: Chong Shangguan
author: Jingxue Ma
author: Gennian Ge
published in: Designs, Codes and Cryptography
publication date: 2018-07-03T00:00:00Z
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6898269
zbMATH Keywords: traitor tracing schemes
zbMATH Keywords: parent-identifying codes
zbMATH Keywords: traceability codes
MaRDI profile type: Publication
full work available at URL: s10623-017-0420-y
OpenAlex ID: W2766065688
cites work: Parent-identifying codes
cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
cites work: A class of I.P.P. codes with efficient identification
cites work: Frameproof Codes
cites work: An upper bound on the size of a code with the \(k\)-identifiable parent property
cites work: Traceability codes
cites work: Collusion-secure fingerprinting for digital data
cites work: On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
cites work: Q4940701
cites work: Tracing traitors
cites work: On codes with the identifiable parent property
cites work: Q2947388
cites work: Separating Hash Families: A Johnson-type bound and New Constructions
cites work: New Bounds for Frameproof Codes
cites work: Applications of list decoding to tracing traitors
cites work: Combinatorial properties of frameproof and traceability codes
cites work: A tight bound for frameproof codes viewed in terms of separating hash families
DOI: 10.1007/S10623-017-0420-Y
description: scientific article; zbMATH DE number 6898269