Upper bounds for parent-identifying set systems

DOI10.1007/s10623-008-9253-zzbMath1236.05050OpenAlexW2069023101MaRDI QIDQ1009142

Michael J. Collins

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9253-z

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Related Items

Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ On non-binary traceability set systems ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Union-intersection-bounded families and their applications

Cites Work

• Families of finite sets in which no set is covered by the union of \(r\) others
• An upper bound on the size of a code with the \(k\)-identifiable parent property
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• A Note About the Traceability Properties of Linear Codes
• Upper Bounds for Set Systems with the Identifiable Parent Property