{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:33:14Z","timestamp":1724135594832},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"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,2]]},"DOI":"10.1007\/s10623-013-9872-x","type":"journal-article","created":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T06:24:21Z","timestamp":1377930261000},"page":"481-493","source":"Crossref","is-referenced-by-count":3,"title":["Decoding mixed errors and erasures in permutation codes"],"prefix":"10.1007","volume":"74","author":[{"given":"Francis H.","family":"Hunt","sequence":"first","affiliation":[]},{"given":"Stephanie","family":"Perkins","sequence":"additional","affiliation":[]},{"given":"Derek H.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,1]]},"reference":[{"key":"9872_CR1","doi-asserted-by":"crossref","unstructured":"Bailey R.F.: Error-correcting codes from permutation groups. Discret. Math. 309, 4253\u20134265 (2009).","DOI":"10.1016\/j.disc.2008.12.027"},{"key":"9872_CR2","unstructured":"Bailey R.F.: Permutation groups, error-correcting codes and uncoverings. Ph.D. Thesis, University of London (2006)."},{"key":"9872_CR3","unstructured":"Chee Y.M., Purkayastha P.: Efficient decoding of permutation codes obtained from distance preserving maps. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, 1\u20136 July, pp. 636\u2013640 (2012)."},{"key":"9872_CR4","doi-asserted-by":"crossref","unstructured":"Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51\u201364 (2004).","DOI":"10.1023\/B:DESI.0000029212.52214.71"},{"key":"9872_CR5","unstructured":"Gordon D.: La Jolla covering repository. http:\/\/www.ccrwest.org\/cover.html (2013). Accessed 15 Jan 2013."},{"key":"9872_CR6","doi-asserted-by":"crossref","unstructured":"Smith D.H., Montemanni R.: A new table of permutation codes. Des. Codes Cryptogr. 63(2), 241\u2013253 (2012).","DOI":"10.1007\/s10623-011-9551-8"},{"key":"9872_CR7","doi-asserted-by":"crossref","unstructured":"Smith D.H., Montemanni R.: Permutation codes with specified packing radius. Des. Codes Cryptogr. 69(1), 95\u2013106 (2013). doi: 10.1007\/s10623-012-9623-4 .","DOI":"10.1007\/s10623-012-9623-4"},{"key":"9872_CR8","unstructured":"Swart T.G., de Beer I., Ferreira H.C., Vinck A.J.H.: Simulation results for permutation trellis codes using M-ary FSK. In: Proceedings of the 2005 International Symposium on Power-Line Communications and Its Applications, Vancouver, Canada, 6\u20138 April, pp. 317\u2013321 (2005)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9872-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9872-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-9872-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T18:33:20Z","timestamp":1563820400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9872-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9872"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9872-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,1]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-013-9872-X', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>2</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>