{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T05:48:09Z","timestamp":1724392089954},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T00:00:00Z","timestamp":1312329600000},"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":[[2012,12]]},"DOI":"10.1007\/s10623-011-9547-4","type":"journal-article","created":{"date-parts":[[2011,8,2]],"date-time":"2011-08-02T01:24:38Z","timestamp":1312248278000},"page":"213-222","source":"Crossref","is-referenced-by-count":11,"title":["Coding with injections"],"prefix":"10.1007","volume":"65","author":[{"given":"Peter J.","family":"Dukes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,3]]},"reference":[{"key":"9547_CR1","doi-asserted-by":"crossref","first-page":"204","DOI":"10.4153\/CJM-1960-017-2","volume":"13","author":"S.A. Chowla","year":"1960","unstructured":"Chowla S.A., Erd\u0151s P., Straus E.G.: On the maximal number of pairwise orthogonal latin squares of a given order. Canad. J. Math. 13, 204\u2013208 (1960)","journal-title":"Canad. J. Math."},{"key":"9547_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/B:DESI.0000029212.52214.71","volume":"32","author":"W. Chu","year":"2004","unstructured":"Chu W., Colbourn C.J., Dukes P.J.: codes for powerline communication. Des. Codes Cryptogr. 32, 51\u201364 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"9547_CR3","first-page":"57","volume":"54","author":"W. Chu","year":"2005","unstructured":"Chu W., Colbourn C.J., Dukes P.J.: Tables for constant composition codes. J. Combin. Math. Combin. Comput. 54, 57\u201365 (2005)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"9547_CR4","volume-title":"The CRC Handbook of Combinatorial Designs","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds): The CRC Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2006)","edition":"2"},{"key":"9547_CR5","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"C.J. Colbourn","year":"2004","unstructured":"Colbourn C.J., Kl\u00f8ve T., Ling A.C.H.: arrays for powerline communication and mutually orthogonal Latin squares. IEEE Trans. Inform. Theory 50, 1289\u20131291 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9547_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0378-3758(78)90008-3","volume":"2","author":"M. Deza","year":"1978","unstructured":"Deza M., Vanstone S.A.: Bounds for permutation arrays. J. Stat. Plan. Infer. 2, 197\u2013209 (1978)","journal-title":"J. Stat. Plan. Infer."},{"key":"9547_CR7","unstructured":"Ferreira H.C., Vinck A.J.H.: Interference Cancellation with Permutation Trellis Codes. Vehicular Technology Conference, 2000. IEEE VTS-Fall VTC 2000. 52nd, vol. 5, pp. 2401\u20132407 (2000)."},{"key":"9547_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0097-3165(77)90009-7","volume":"22","author":"P. Frankl","year":"1977","unstructured":"Frankl P., Deza M.: On the maximum number of permutations with given maximal or minimal distance. J. Combin. Theory Ser. A 22, 352\u2013360 (1977)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9547_CR9","unstructured":"Janiszczak I., Staszewski R.: An improved bound for permutation arrays of length 10, preprint."},{"key":"9547_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10623-006-0017-3","volume":"41","author":"P. Keevash","year":"2006","unstructured":"Keevash P., Ku C.Y.: A random construction for permutation codes and the covering radius. Des. Codes Cryptogr. 41, 79\u201386 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"9547_CR11","unstructured":"Kl\u00f8ve T.: Classification of permutation codes of length 6 and minimum distance 5. Proc. Int. Symp. Information Theory Appl., pp. 465\u2013468 (2000)."},{"key":"9547_CR12","unstructured":"Soicher L.H.: The GRAPE package for GAP, Version 4.3, (2006). http:\/\/www.maths.qmul.ac.uk\/~leonard\/grape\/ ."},{"key":"9547_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/eujc.1998.0272","volume":"20","author":"H. Tarnanen","year":"1999","unstructured":"Tarnanen H.: bounds on permutation codes via linear programming. Eur. J. Combin. 20, 101\u2013114 (1999)","journal-title":"Eur. J. Combin."},{"key":"9547_CR14","unstructured":"Teirlinck L.: Large sets of disjoint designs and related structures. In: Contemporary Design Theory, pp. 561\u2013592. Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York (1992)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9547-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9547-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9547-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:30Z","timestamp":1559231910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9547-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9547"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9547-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,3]]}}}