{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:45:27Z","timestamp":1648608327004},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T00:00:00Z","timestamp":1338940800000},"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-012-9684-4","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T19:20:57Z","timestamp":1338924057000},"page":"325-351","source":"Crossref","is-referenced-by-count":1,"title":["Constructions for retransmission permutation arrays"],"prefix":"10.1007","volume":"65","author":[{"given":"Jeffrey H.","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Maura B.","family":"Paterson","sequence":"additional","affiliation":[]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[]},{"given":"Ruizhong","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"issue":"5","key":"9684_CR1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/00029890.2008.11920542","volume":"115","author":"R.A. Bailey","year":"2008","unstructured":"Bailey R.A., Cameron P., Connelly R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Mon. 115(5), 383\u2013404 (2008)","journal-title":"Am. Math. Mon."},{"key":"9684_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0743-7315(92)90116-5","volume":"14","author":"C.J. Colbourn","year":"1992","unstructured":"Colbourn C.J., Heinrich K.E.: Conflict-free access to parallel memories. J. Parallel Distrib. Comput. 14, 193\u2013200 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9684_CR3","first-page":"239","volume":"90","author":"D.L. Erickson","year":"1992","unstructured":"Erickson D.L., Colbourn C.J.: Conflict-free access to rectangular subarrays. Congr. Numer. 90, 239\u2013253 (1992)","journal-title":"Congr. Numer."},{"key":"9684_CR4","doi-asserted-by":"crossref","unstructured":"Li L.E., Liu J., Tan K., Viswanathan H., Yang Y.R.: Retransmission \u2260\u00a0 repeat: simple retransmission permutation can resolve overlapping channel collisions. Eighth ACM Workshop on Hot Topics in Networks (HotNets-VIII), 2009.","DOI":"10.1145\/1859995.1860028"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9684-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9684-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9684-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T11:20:31Z","timestamp":1561807231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9684-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,6]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9684"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9684-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,6]]}}}