{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:35:26Z","timestamp":1774020926381,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1007\/bf01390767","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T12:14:19Z","timestamp":1112444059000},"page":"5-20","source":"Crossref","is-referenced-by-count":30,"title":["On the construction of perfect deletion-correcting codes using design theory"],"prefix":"10.1007","volume":"6","author":[{"given":"Patrick A. H.","family":"Bours","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"No. 1","key":"CR1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TIT.1969.1054256","volume":"15","author":"L. Calabi","year":"1969","unstructured":"L. Calabi and W. E. Hartnett, A family of codes for the correction of substitution and synchronization errors,IEEE Transactions on Information Theory, Vol. IT-15, No. 1 (1969) pp. 102?106.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0019-9958(69)90442-2","volume":"15","author":"L. Calabi","year":"1969","unstructured":"L. Calabi and W. E. Hartnett, Some general results of coding theory with applications to the study of codes for the correction of synchronization errors.Information and Control, Vol. 15 (1969), pp. 235?249.","journal-title":"Information and Control"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4153\/CJM-1954-005-4","volume":"6","author":"M. Hall Jr.","year":"1954","unstructured":"M. Hall, Jr., and W. S. Conner, Jr., An embedding theorem for balanced incomplete block designs,Canadian Journal of Mathematics, Vol. 6 (1954) pp. 35?41.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1214\/aoms\/1177705047","volume":"32","author":"H. Hanani","year":"1961","unstructured":"H. Hanani, The existence and construction of balanced incomplete block designs,Ann. Math. Stat., Vol. 32 (1961) pp. 361?386.","journal-title":"Ann. Math. Stat."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0097-3165(72)90035-0","volume":"12","author":"H. Hanani","year":"1972","unstructured":"H. Hanani, On balanced incomplete block designs with blocks having five elements,Journal of Combinatorial Theory (A), Vol. 12 (1972) pp. 184?201.","journal-title":"Journal of Combinatorial Theory (A)"},{"issue":"No. 4","key":"CR6","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/18.243463","volume":"22","author":"D. H. L. Hollmann","year":"1993","unstructured":"D. H. L. Hollmann, A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes,IEEE Transactions on Information Theory, Vol. IT-22, No. 4 (1993), pp. 1424?1427.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"No. 4","key":"CR7","first-page":"845","volume":"163","author":"V. I. Levenshtein","year":"1965","unstructured":"V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals (Russian),Doklady Akademii Nauk SSSR, Vol. 163, No. 4 (1965) pp. 845?848; (English),Soviet Physics Doklady, Vol. 10, No. 8 (1966) pp. 707?710.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR8","first-page":"298","volume":"19","author":"V. I. Levenshtein","year":"1967","unstructured":"V. I. Levenshtein, Asymptotically optimum binary code with correction for losses of one or two adjacent bits,Problems of Cybernetics, Vol. 19 (1967) pp. 298?304.","journal-title":"Problems of Cybernetics"},{"issue":"No. 1","key":"CR9","first-page":"3","volume":"3","author":"V. I. Levenshtein","year":"1991","unstructured":"V. I. Levenshtein, On perfect codes in deletion and insertion metric (Russian),Discretnaya. Mathematika, Vol. 3, No. 1 (1991) pp. 3?20; (English),Discrete Mathematics Applied, Vol. 2, No. 3 (1992) pp. 241?258.","journal-title":"Discretnaya. Mathematika"},{"key":"CR10","unstructured":"J. H. van Lint and R. M. Wilson,A Course in Combinatorics, Cambridge University Press (1992)."},{"issue":"No. 1","key":"CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1962.1057684","volume":"8","author":"F. F. Sellers","year":"1962","unstructured":"F. F. Sellers, Bit loss and gain correction code,IRE Transaction on Information Theory, Vol. IT-8, No. 1 (1962) pp. 35?38.","journal-title":"IRE Transaction on Information Theory"},{"key":"CR12","first-page":"27","volume":"18","author":"D. J. Street","year":"1980","unstructured":"D. J. Street and J. Seberry, All DBIBDs with block size four exist,Utilitas Mathematica, Vol. 18 (1980) pp. 27?34.","journal-title":"Utilitas Mathematica"},{"key":"CR13","first-page":"161","volume":"18","author":"D. J. Street","year":"1980","unstructured":"D. J. Street and W. H. Wilson, On directed balanced incomplete block designs with block size five,Utilitas Mathematica, Vol. 18 (1980) pp. 161?174.","journal-title":"Utilitas Mathematica"},{"issue":"No. 2","key":"CR14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TIT.1976.1055532","volume":"22","author":"E. Tanaka","year":"1976","unstructured":"E. Tanaka and T. Kasai, Synchronization and substitution error-correcting codes for the Levenshtein metric,IEEE Transactions on Information Theory, Vol. IT-22, No. 2 (1976) pp. 156?162.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"No. 5","key":"CR15","first-page":"174","volume":"37","author":"G. M. Tenengolts","year":"1976","unstructured":"G. M. Tenengolts, Class of codes correcting bit loss and errors in the preceding bit (Russian),Avtomatika i Telemekhanika, Vol. 37, No. 5 (1976) pp. 174?179; (English),Automation and Remote Control, Vol. 37 (1976) pp. 797?802.","journal-title":"Avtomatika i Telemekhanika"},{"issue":"No. 5","key":"CR16","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/TIT.1984.1056962","volume":"30","author":"G. Tenegolts","year":"1984","unstructured":"G. Tenegolts, Nonbinary codes, correcting single deletion or insertion,IEEE Transactions on Information Theory, Vol. IT-30, No. 5 (1984) pp. 766?769.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TIT.1966.1053920","volume":"12","author":"J. D. Ullman","year":"1966","unstructured":"J. D. Ullman, Near-optimal, single-synchronization-error-correcting code,IEEE Transactions on Information Theory, Vol. IT-12 (1966) pp. 418?424.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01390767\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01390767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01390767\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01390767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:25:44Z","timestamp":1556799944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01390767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01390767"],"URL":"https:\/\/doi.org\/10.1007\/bf01390767","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}