scientific article; zbMATH DE number 6534450
From MaRDI portal
Publication:3465618
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
- Tracing traitors by guessing secrets. The q-ary case
- 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
- Linear code implies public-key traitor tracing with revocation
Cited in
(2)
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)