Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference8 articles.
1. Alon N., Stav U.: New bounds on parent-identifying codes: the case of multiple parents. Comb. Probab. Comput. 13(6), 795–807 (2004)
2. Blackburn S.R.: An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A 102(1), 179–185 (2003)
3. Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inform. Theory 46(3), 893–910 (2000)
4. Collins M.J.: Upper bounds for set systems with the identifiable parent property. In: Safavi-Naini R. (ed.) ICITS, vol. 5155 of Lecture Notes in Computer Science, pp. 100–106. Springer (2008).
5. Fernandez M., Navau J.C., Soriano M., Domingo N.: A note about the traceability properties of linear codes. In: Nam K.-H., Rhee G. (eds.) ICISC, vol. 4817 of Lecture Notes in Computer Science, pp. 251–258. Springer (2007).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献