{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:03:20Z","timestamp":1745557400817},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,9]],"date-time":"2013-07-09T00:00:00Z","timestamp":1373328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10623-013-9848-x","type":"journal-article","created":{"date-parts":[[2013,7,8]],"date-time":"2013-07-08T05:00:40Z","timestamp":1373259640000},"page":"127-151","source":"Crossref","is-referenced-by-count":1,"title":["Spectrum of sizes for perfect 2-deletion-correcting codes of length 4"],"prefix":"10.1007","volume":"74","author":[{"given":"Hengjia","family":"Wei","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,9]]},"reference":[{"key":"9848_CR1","doi-asserted-by":"crossref","unstructured":"Bours P.A.H.: On the construction of perfect deletion-correcting codes using design theory. Des. Codes Cryptogr. 6, 5\u201320 (1995).","DOI":"10.1007\/BF01390767"},{"key":"9848_CR2","unstructured":"Chee Y.M., Ge G., Ling A.C.H.: Spectrum of sizes for perfect deletion-correcting codes. SIAM J. Discret. Math. 24, 33\u201355 (2010)."},{"key":"9848_CR3","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H. (eds.): CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996).","DOI":"10.1201\/9781420049954"},{"key":"9848_CR4","unstructured":"Ge G., Ling A.C.H.: Group divisible designs with block size four and group type $$g^{u}m^{1}$$ g u m 1 for small $$g$$ g . Discret. Math. 285, 97\u2013120 (2004)."},{"key":"9848_CR5","unstructured":"Ge G., Rees R.: On group-divisible designs with block size four and group-type $$6^{u}m^{1}$$ 6 u m 1 . Discret. Math. 279, 247\u2013265 (2004)."},{"key":"9848_CR6","unstructured":"Hartman A.: On small packing and covering design with block size $$4$$ 4 . Discret. Math. 59, 275\u2013281 (1986)."},{"key":"9848_CR7","unstructured":"Immink K.A.S.: Codes for Mass Data Storage Systems, 2nd edn. Shannon Foundation Publishers, Eindhoven (2004)."},{"key":"9848_CR8","doi-asserted-by":"crossref","unstructured":"Kinniment D.J.: Synchronization and Arbitration in Digital Systems. Wiley, Hoboken (2008).","DOI":"10.1002\/9780470517147"},{"key":"9848_CR9","unstructured":"Levenshte\u012dn V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707\u2013710 (1965)."},{"key":"9848_CR10","unstructured":"Levenshte\u012dn V.I.: Perfect codes in the metric of deletions and insertions. Discret. Math. 3, 3\u201320 (1991)."},{"key":"9848_CR11","unstructured":"Marron M., Swenson K.M., Moret B.M.E.: Genomic distances under deletions and insertions. In: Computing and Combinatorics. Lecture Notes in Computer Science, vol. 2697, pp. 537\u2013547. Springer, Berlin (2003)."},{"key":"9848_CR12","unstructured":"Pratt C.W., Cornely K.: Essential Biochemistry. Wiley, New York (2004)."},{"key":"9848_CR13","unstructured":"Sarvate D.G.: Some results on directed and cyclic designs. Ars Combin. 19, 179\u2013190 (1985)."},{"key":"9848_CR14","doi-asserted-by":"crossref","unstructured":"Shalaby N., Wang J., Yin J.: Existence of perfect $$4$$ 4 -deletion-correcting codes with length six. Des. Codes Cryptogr. 27, 145\u2013156 (2002).","DOI":"10.1023\/A:1016562821812"},{"key":"9848_CR15","unstructured":"Sklar B.: Digital Communications: Fundamentals and Applications, 2nd edn. Prentice Hall Communications Engineering and Emerging Technologies Series, New Jersey (2001)."},{"key":"9848_CR16","doi-asserted-by":"crossref","unstructured":"Wang J.: Some combinatorial constructions for optimal perfect deletion-correcting codes. Des. Codes Cryptogr. 48, 331\u2013347 (2008).","DOI":"10.1007\/s10623-008-9212-8"},{"key":"9848_CR17","doi-asserted-by":"crossref","unstructured":"Wang J., Shen H.: Existence of $$(v, K_{1(3)} \\cup \\{w^{*}\\})$$ ( v , K 1 ( 3 ) \u222a { w \u2217 } ) -PBDs and its applications. Des. Codes Cryptogr. 46, 1\u201316 (2008).","DOI":"10.1007\/s10623-007-9122-1"},{"key":"9848_CR18","unstructured":"Wang J., Yin J.: Constructions for perfect 5-deletion-correcting codes of length $$7$$ 7 . IEEE Trans. Inf. Theory 52, 3676\u20133685 (2006)."},{"key":"9848_CR19","doi-asserted-by":"crossref","unstructured":"Yin J.: A combinatorial construction for perfect deletion-correcting codes. Des. Codes Cryptogr. 23, 99\u2013110 (1999).","DOI":"10.1023\/A:1011271920403"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9848-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9848-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9848-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T12:32:19Z","timestamp":1563366739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9848-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9848"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9848-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,9]]}}}