New results on frame-proof codes and traceability schemes

Safavi-Naini, Reihaneh; Wang, Yejing

New results on frame-proof codes and traceability schemes

journal contribution

posted on 2024-11-15, 04:05 authored by Reihaneh Safavi-Naini, Yejing Wang

In this correspondence we derive lower bounds on the maximum number of codewords in a class of frame-proof codes and traceability schemes, and give constructions for both with more codewords than the best known.

History

Citation

This article was originally published as: Safavi-Naini ,R & Wang, Y, New results on frame-proof codes and traceability schemes, IEEE Transactions on Information Theory, November 2001, 47(7) 3029-3033. Copyright IEEE 2001.

Journal title

IEEE Transactions on Information Theory

Volume

47

Issue

7

Pagination

3029-3033

Publisher website/DOI

https://doi.org/10.1109/18.959283

Language

English

RIS ID

6376

Usage metrics

Keywords

error-correcting codes frame-proof codes -sets traceability schemes

New results on frame-proof codes and traceability schemes

History

Citation

Journal title

Volume

Issue

Pagination

Publisher website/DOI

Language

RIS ID

Usage metrics

Categories

Keywords

Licence

Exports