Pages that link to "Item:Q4680056"

The following pages link to Digital fingerprinting codes: problem statements, constructions, identification of traitors (Q4680056):

Displaying 22 items.

• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
• Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection (Q327317) (← links)
• A simple fingerprinting scheme for large user groups (Q352053) (← links)
• Cover-free codes and separating system codes (Q510467) (← links)
• Codes with the identifiable parent property for multimedia fingerprinting (Q517266) (← links)
• Sequential Monte Carlo for rare event estimation (Q693307) (← links)
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing (Q1727360) (← links)
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes (Q1741920) (← links)
• Bounds on the rate of separating codes (Q1752294) (← links)
• A class of I.P.P. codes with efficient identification (Q1827562) (← links)
• Traceability codes (Q1957960) (← links)
• Separable collusion-secure multimedia codes (Q2044131) (← links)
• Multimedia IPP codes with efficient tracing (Q2182061) (← links)
• Generalization of IPP codes and IPP set systems (Q2190902) (← links)
• Traceability codes and their generalizations (Q2190905) (← links)
• Wide-sense 2-frameproof codes (Q2211333) (← links)
• Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise (Q2229581) (← links)
• On generalized separating hash families (Q2469200) (← links)
• Optimal 2-traceability codes of length 4 (Q2697541) (← links)
• Equal-Weight Fingerprinting Codes (Q5322997) (← links)
• Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
• Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory (Q6173473) (← links)