Traceability codes (Q1957960)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Traceability codes	scientific article

Statements

scholarly article

0 references

Traceability codes (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.jcta.2010.02.009

0 references

Simon R. Blackburn

0 references

0 references

0 references

Journal of Combinatorial Theory. Series A

0 references

publication date

27 September 2010

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

traceability code

0 references

probabilistic construction

0 references

IPP code

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jcta.2010.02.009

0 references

0 references

New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

0 references

Digital fingerprinting codes: problem statements, constructions, identification of traitors

0 references

A class of I.P.P. codes with efficient identification

0 references

0 references

An upper bound on the size of a code with the \(k\)-identifiable parent property

0 references

Paths in graphs

0 references

0 references

A Note About the Traceability Properties of Linear Codes

0 references

On codes with the identifiable parent property

0 references

0 references

Combinatorial Properties for Traceability Codes Using Error Correcting Codes

0 references

Codes for copyright protection: the case of two pirates

0 references

A class of traceability codes

0 references

0 references

Combinatorial properties of frameproof and traceability codes

0 references

On a class of traceability codes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1957960

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1957960&oldid=35190727"