{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:08:28Z","timestamp":1754158108853,"version":"3.41.2"},"reference-count":9,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2007,2,27]],"date-time":"2007-02-27T00:00:00Z","timestamp":1172534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,2,27]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Pupose<\/jats:title><jats:p>The purpose of this paper is to show that a fingerprinting code is a set of code words that are embedded in each copy of a digital object, with the purpose of making each copy unique. If the fingerprinting code is <jats:italic>c<\/jats:italic>\u2010secure, then the decoding of a pirate word created by a coalition of at most <jats:italic>c<\/jats:italic> dishonest users, will expose at least one of the guilty parties.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The paper presents a systematic strategy for collusions attacking a fingerprinting scheme. As a particular case, this strategy shows that linear codes are not good fingerprinting codes. Based on binary linear equidistant codes, the paper constructs a family of fingerprinting codes in which the identification of guilty users can be efficiently done using minimum distance decoding. Moreover, in order to obtain codes with a better rate a 2\u2010secure fingerprinting code is also constructed by concatenating a code from the previous family with an outer IPP code.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The particular choice of the codes is such that it allows the use of efficient decoding algorithms that correct errors beyond the error correction bound of the code, namely a simplified version of the Chase algorithms for the inner code and the Koetter\u2010Vardy soft\u2010decision list decoding algorithm for the outer code.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper presents a fingerprinting code together with an efficient chasing algorithm.<\/jats:p><\/jats:sec>","DOI":"10.1108\/14684520710731010","type":"journal-article","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T13:03:06Z","timestamp":1172667786000},"page":"22-37","source":"Crossref","is-referenced-by-count":2,"title":["A class of non\u2010linear asymptotic fingerprinting codes with <i>\u03b5<\/i>\u2010error"],"prefix":"10.1108","volume":"31","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[]},{"given":"Josep","family":"Cotrina\u2010Navau","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Soriano","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022020620135137000_b1","doi-asserted-by":"crossref","unstructured":"Barg, A., Blakley, G.R. and Kabatiansky, G. (2003), \u201cDigital fingerprinting codes: problem statements, constructions, identification of traitors\u201d, IEEE Transactions on Information Theory, Vol. 49 No. 4, pp. 852\u201065.","DOI":"10.1109\/TIT.2003.809570"},{"key":"key2022020620135137000_b2","doi-asserted-by":"crossref","unstructured":"Boneh, D. and Shaw, J. (1998), \u201cCollusion\u2010secure fingerprinting for digital data\u201d, IEEE Transactions on Information Theory, Vol. 44 No. 5, pp. 1897\u2010905.","DOI":"10.1109\/18.705568"},{"key":"key2022020620135137000_b3","unstructured":"Bonisoli, A. (1984), \u201cEvery equidistant linear code is a sequence of dual hamming codes\u201d, Ars Combinatoria, Vol. 18, pp. 181\u201096."},{"key":"key2022020620135137000_b4","doi-asserted-by":"crossref","unstructured":"Chase, D. (1972), \u201cA class of algorithms for decoding block codes with channel measurement information\u201d, IEEE Transactions on Information Theory, Vol. 18, pp. 170\u201082.","DOI":"10.1109\/TIT.1972.1054746"},{"key":"key2022020620135137000_b5","unstructured":"Cohen, G., Encheva, S. and Schaathun, H.G. (2001), On Separating Codes, technical report, ENST, Paris."},{"key":"key2022020620135137000_b6","doi-asserted-by":"crossref","unstructured":"Guruswami, V. and Sudan, M. (1999), \u201cImproved decoding of Reed\u2010Solomon and algebraic\u2010geometry codes\u201d, IEEE Transactions on Information Theory, Vol. 45 No. 6, pp. 1757\u201067.","DOI":"10.1109\/18.782097"},{"key":"key2022020620135137000_b7","doi-asserted-by":"crossref","unstructured":"Hollmann Henk, D.L., van Lint, J.H., Linnartz, J\u2010P. and Tolhuizen Ludo, M.G.M. (1998), \u201cOn codes with the Identifiable Parent Property\u201d, Journal of Combinatorial Theory, Vol. 82 No. 2, pp. 121\u201033.","DOI":"10.1006\/jcta.1997.2851"},{"key":"key2022020620135137000_b8","doi-asserted-by":"crossref","unstructured":"Koetter, R. and Vardy, A. (2000), \u201cAlgebraic soft\u2010decision decoding of Reed\u2010Solomon codes\u201d, IEEE Transactions on Information Theory, Vol. 49 No. 11, pp. 2809\u201025.","DOI":"10.1109\/TIT.2003.819332"},{"key":"key2022020620135137000_b9","unstructured":"MacWilliams, F.J. and Sloane, N.J.A. (1997), The Theory of Error\u2010Correcting Codes, North Holland, New York, NY."}],"container-title":["Online Information Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520710731010\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520710731010\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:40:43Z","timestamp":1753404043000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/oir\/article\/31\/1\/22-37\/314728"}},"subtitle":[],"editor":[{"given":"Mariemma","family":"Yag\u00fce","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2007,2,27]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,27]]}},"alternative-id":["10.1108\/14684520710731010"],"URL":"https:\/\/doi.org\/10.1108\/14684520710731010","relation":{},"ISSN":["1468-4527"],"issn-type":[{"type":"print","value":"1468-4527"}],"subject":[],"published":{"date-parts":[[2007,2,27]]}}}