The following pages link to New constructions for IPP codes (Q1781000):
Displaying 18 items.
- Improved bounds for separating hash families (Q369437) (← links)
- On the relationship between the traceability properties of Reed-Solomon codes (Q394835) (← links)
- Codes with the identifiable parent property for multimedia fingerprinting (Q517266) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Explicit constructions of separating hash families from algebraic curves over finite fields (Q851784) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- Analysis of two tracing traitor schemes via coding theory (Q1705510) (← links)
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance (Q2115728) (← links)
- Multimedia IPP codes with efficient tracing (Q2182061) (← links)
- Generalization of IPP codes and IPP set systems (Q2190902) (← links)
- On non-binary traceability set systems (Q2200518) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Recursive constructions of secure codes and hash families using difference function families. (Q2490863) (← links)
- Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
- Hat guessing number for the class of planar graphs is at least 22 (Q6177422) (← links)
- Covering array on the Cartesian product of hypergraphs (Q6581902) (← links)
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\) (Q6618621) (← links)
