Tracing Many Users With Almost No Rate Penalty

DOI10.1109/TIT.2006.887089zbMATH Open1310.94230OpenAlexW2147707337MaRDI QIDQ3548152FDOQ3548152

Authors: Noga Alon, Vera Asodi 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.887089

Recommendations

• Tracing a single user
• Single-User Tracing and Disjointly Superimposed Codes
• Traces of hypergraphs
• Traceability codes
• A note on traces of set families

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Bounds on codes (94B65)

Cited In (6)

• Uniform hypergraphs containing no grids
• Tracing a single user
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
• Single-User Tracing and Disjointly Superimposed Codes
• Black-box Trace\&Revoke codes

This page was built for publication: Tracing Many Users With Almost No Rate Penalty

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