scientific article; zbMATH DE number 6534450

zbMATH Open1361.94057MaRDI QIDQ3465618FDOQ3465618

Authors: Sergej A. Yevpak, V. V. Mkrtichyan 

Publication date: 22 January 2016

Full work available at URL: http://mathnet.ru/eng/vmj502

Title of this publication is not available (Why is that?)

Recommendations

• On the relationship between the traceability properties of Reed-Solomon codes
• Analysis of two tracing traitor schemes via coding theory
• Efficient Traitor Tracing from Collusion Secure Codes
• Identification of Traitors in Algebraic-Geometric Traceability Codes
• On bit-level trellis complexity of Reed-Muller codes
• Information Security Practice and Experience
• A note on an upper bound of traceability codes
• On the dimension of trace codes
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Information Security and Privacy

zbMATH Keywords

traitor tracingcoalitiondescendants\(q\)-ary Reed-Muller codesidentifiable parent property (IPP)noise-resistant codetraceability codes (TA-codes)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (2)

• Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
• On the Properties of Algebraic Geometric Codes as Copy Protection Codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465618)