{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:17Z","timestamp":1771611137463,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,12,23]],"date-time":"2006-12-23T00:00:00Z","timestamp":1166832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,1,9]]},"DOI":"10.1007\/s10623-006-9032-7","type":"journal-article","created":{"date-parts":[[2006,12,22]],"date-time":"2006-12-22T18:12:12Z","timestamp":1166811132000},"page":"227-237","source":"Crossref","is-referenced-by-count":17,"title":["Construction of deletion correcting codes using generalized Reed\u2013Solomon codes and their subcodes"],"prefix":"10.1007","volume":"42","author":[{"given":"Dongvu","family":"Tonien","sequence":"first","affiliation":[]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,23]]},"reference":[{"key":"9032_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01390767","volume":"6","author":"PAH Bours","year":"1995","unstructured":"Bours PAH (1995) On the construction of perfect deletion-correcting codes using design theory. Design Code Cryptogr 6:5\u201320","journal-title":"Design Code Cryptogr"},{"key":"9032_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0019-9958(69)90442-2","volume":"15","author":"L Calabi","year":"1969","unstructured":"Calabi L, Hartnett WE (1969) Some general results of coding theory with applications to the study of codes for the correction of synchronisation errors. Inf Control 15:235\u2013249","journal-title":"Inf Control"},{"issue":"2","key":"9032_CR3","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/18.910582","volume":"47","author":"MC Davey","year":"2001","unstructured":"Davey MC, MacKay DJC (2001) Reliable communication over channels with insertions, deletions and substitutions. IEEE Trans Inf Theory 47(2):687\u2013696","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"9032_CR4","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V Guruswami","year":"1999","unstructured":"Guruswami V, Sudan M (1999) Improved decoding of Reed\u2013Solomon and algebraic geometry codes. IEEE Trans Inf Theory 45(6):1757\u20131767","journal-title":"IEEE Trans Inf Theory"},{"key":"9032_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/18.370100","volume":"41","author":"T Klove","year":"1995","unstructured":"Klove T (1995) Codes correcting a single insertion\/deletion of a zero or a single peakshift. IEEE Trans Inf Theory 41:279\u2013283","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"9032_CR6","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys-Dokl 10(8):707\u2013710","journal-title":"Sov Phys-Dokl"},{"issue":"3","key":"9032_CR7","first-page":"215","volume":"7","author":"VI Levenshtein","year":"1971","unstructured":"Levenshtein VI (1971) One method of constructing quasilinear codes providing synchronisation in the presence of errors. Prob Inf Trans 7(3):215\u2013222","journal-title":"Prob Inf Trans"},{"key":"9032_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1008212622423","volume":"14","author":"A Mahmoodi","year":"1998","unstructured":"Mahmoodi A (1998) Existence of perfect 3-deletion-correcting codes. Design Code Cryptogr 14:81\u201387","journal-title":"Design Code Cryptogr"},{"issue":"LNCS 2696","key":"9032_CR9","first-page":"81","volume":"02","author":"R Safavi-Naini","year":"2003","unstructured":"Safavi-Naini R, Wang Y (2003) Traitor tracing for shortened and corrupted fingerprints. ACM-DRM\u201902 LNCS 2696:81\u2013100","journal-title":"ACM-DRM\u2019"},{"key":"9032_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1016562821812","volume":"27","author":"N Shalaby","year":"2002","unstructured":"Shalaby N, Wang J, Yin J (2002) Existence of perfect 4-deletion-correcting codes with length six. Design Code Cryptogr 27:145\u2013156","journal-title":"Design Code Cryptogr"},{"key":"9032_CR11","first-page":"273","volume":"10","author":"NJA Sloane","year":"2002","unstructured":"Sloane NJA (2002) On single-deletion-correcting codes. Code Designs Math Res Inst Publ 10:273\u2013292","journal-title":"Code Designs Math Res Inst Publ"},{"key":"9032_CR12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TIT.1976.1055532","volume":"22","author":"E Tanaka","year":"1976","unstructured":"Tanaka E, Kasai T (1976) Synchronization and substitution error-correcting codes for the Levenshtein metric. IEEE Trans Inf Theory 22:156\u2013162","journal-title":"IEEE Trans Inf Theory"},{"key":"9032_CR13","first-page":"345","volume":"23","author":"Y Wang","year":"2004","unstructured":"Wang Y, McAven L, Safavi-Naini R (2004) Deletion correcting using generalized Reed\u2013Solomon codes. Prog Comput Sci Appl Logic 23:345\u2013358","journal-title":"Prog Comput Sci Appl Logic"},{"key":"9032_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1011271920403","volume":"23","author":"J Yin","year":"2001","unstructured":"Yin J (2001) A combinatorial construction for perfect deletion-correcting Codes. Design Code Cryptogr 23:99\u2013110","journal-title":"Design Code Cryptogr"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9032-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-006-9032-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9032-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:07Z","timestamp":1559245807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-006-9032-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,23]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1,9]]}},"alternative-id":["9032"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9032-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,23]]}}}