{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:39Z","timestamp":1740122559004,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["10\/12"],"award-info":[{"award-number":["10\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IBM Ph.D. fellowship"},{"name":"The Aharon and Ephraim Katzir study grant"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1624\/14"],"award-info":[{"award-number":["1624\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10623-017-0378-9","type":"journal-article","created":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T03:33:55Z","timestamp":1498880035000},"page":"387-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coding for locality in reconstructing permutations"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1686-1994","authenticated-orcid":false,"given":"Netanel","family":"Raviv","sequence":"first","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"378_CR1","volume-title":"The Probabilistic Method","author":"N Alon","year":"2004","unstructured":"Alon N., Spencer J.H.: The Probabilistic Method. Wiley, New York (2004)."},{"issue":"7","key":"378_CR2","doi-asserted-by":"crossref","first-page":"3158","DOI":"10.1109\/TIT.2010.2048455","volume":"56","author":"A Barg","year":"2010","unstructured":"Barg A., Mazumdar A.: Codes in permutations and error correction for rank modulation. IEEE Trans. Inf. Theory 56(7), 3158\u20133165 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"378_CR3","first-page":"216","volume-title":"Incremental Cryptography: The Case of Hashing and Signing. Advances in Cryptology (CRYPTO)","author":"M Bellare","year":"1994","unstructured":"Bellare M., Goldreich O., Goldwasser S.: Incremental Cryptography: The Case of Hashing and Signing. Advances in Cryptology (CRYPTO), pp. 216\u2013233. Springer, Berlin (1994)."},{"key":"378_CR4","doi-asserted-by":"crossref","unstructured":"Bellare M., Goldreich O., Goldwasser S.: Incremental cryptography and application to virus protection. In: ACM 27th Annual Symposium on Theory of Computing (STOC), pp. 45\u201356 (1995).","DOI":"10.1145\/225058.225080"},{"key":"378_CR5","unstructured":"Beyer I., Smith T.F., Stein M.L., Ulam S.M.: Metrics in biology, an introduction. Los Alamos Scientific Laboratory Report, LA-4973 (1972)."},{"issue":"1","key":"378_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(79)90076-7","volume":"43","author":"IF Blake","year":"1979","unstructured":"Blake I.F., Cohen G., Deza M.: Coding with permutations. Inf. Control 43(1), 1\u201319 (1979).","journal-title":"Inf. Control"},{"key":"378_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/b12210","volume-title":"Combinatorics of Permutations","author":"M B\u00f3na","year":"2012","unstructured":"B\u00f3na M.: Combinatorics of Permutations. CRC Press, Boca Raton (2012)."},{"issue":"4","key":"378_CR8","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1109\/TIT.2016.2519400","volume":"62","author":"S Buzaglo","year":"2016","unstructured":"Buzaglo S., Yaakobi E.: On the capacity of constrained permutation codes for rank modulation. IEEE Trans. Inf. Theory 62(4), 1649\u20131666 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"378_CR9","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.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32(1\u20133), 51\u201364 (2004).","journal-title":"Des. Codes Cryptogr."},{"key":"378_CR10","unstructured":"Cooper C.: A lower bound for the number of good permutations. In Data Recording, Storage and Processing (The National Academy of Sciences of Ukraine), vol. 213, pp. 15\u201325 (2000)."},{"key":"378_CR11","unstructured":"Deza M., Huang T.: Metrics on permutations, a survey. J. Comb. Inf. Syst. Sci. (1998)."},{"key":"378_CR12","volume-title":"Abstract Algebra","author":"DS Dummit","year":"1991","unstructured":"Dummit D.S., Foote R.M.: Abstract Algebra. Prentice Hall, Englewood Cliffs, NJ (1991)."},{"key":"378_CR13","unstructured":"Eberhard S., Manners F., Mrazovi\u0107 R.: Additive triples of bijections, or the toroidal semiqueens problem. arXiv:1510.05987 (2015)."},{"issue":"5","key":"378_CR14","doi-asserted-by":"crossref","first-page":"3003","DOI":"10.1109\/TIT.2013.2239700","volume":"59","author":"F Farnoud","year":"2013","unstructured":"Farnoud F., Skachek V., Milenkovic O.: Error-correction in flash memories via codes in the Ulam metric. IEEE Trans. Inf. Theory 59(5), 3003\u20133020 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"378_CR15","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/TIT.2015.2493147","volume":"62","author":"R Gabrys","year":"2016","unstructured":"Gabrys R., Yaakobi E., Farnoud F., Sala F., Bruck J., Dolecek L.: Codes correcting erasures and deletions for rank modulation. IEEE Trans. Inf. Theory 62(1), 136\u2013150 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"378_CR16","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1109\/TIT.2009.2018336","volume":"55","author":"A Jiang","year":"2009","unstructured":"Jiang A., Mateescu R., Schwartz M., Bruck J.: Rank modulation for flash memories. IEEE Trans. Inf. Theory 55(6), 2659\u20132673 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"378_CR17","unstructured":"Konstantinova E., Levenshtein V., Siemons J.: Reconstruction of permutations distorted by single transposition errors. arXiv:math\/0702191 (2007)."},{"issue":"44","key":"378_CR18","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114\u2013116 (1978).","journal-title":"DSN Prog. Rep."},{"issue":"3","key":"378_CR19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10623-006-0012-8","volume":"40","author":"BD McKay","year":"2006","unstructured":"McKay B.D., McLeod J.C., Wanless I.M.: The number of transversals in a Latin square. Des. Codes Cryptogr. 40(3), 269\u2013284 (2006).","journal-title":"Des. Codes Cryptogr."},{"key":"378_CR20","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"JI Munro","year":"2012","unstructured":"Munro J.I., Raman R., Raman V., Rao S.: Succinct representations of permutations and functions. Theor. Comput. Sci. 438, 74\u201388 (2012).","journal-title":"Theor. Comput. Sci."},{"key":"378_CR21","doi-asserted-by":"crossref","unstructured":"Patrascu M.: Succincter. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 305\u2013313 (2008).","DOI":"10.1109\/FOCS.2008.83"},{"key":"378_CR22","doi-asserted-by":"crossref","unstructured":"Prakash N., Kamath G.M., Lalitha V., Kumar P.V.: Optimal linear codes with a local-error-correction property. In: IEEE International Symposium on Information Theory (ISIT), pp. 2776\u20132780 (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"378_CR23","doi-asserted-by":"crossref","unstructured":"Raviv N., Yaakobi E., M\u00e9dard M.: Coding for locality in reconstructing permutations. In: IEEE International Symposium on Information Theory (ISIT), pp. 450\u2013454 (2016).","DOI":"10.1109\/ISIT.2016.7541339"},{"key":"378_CR24","unstructured":"Rouayheb, S.E., Goparaju, S.E., Kiah, H.M., Milenkovic, O.: Synchronizing edits in distributed storage networks. arXiv:1409.1551 (2014)."},{"issue":"4","key":"378_CR25","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1016\/j.laa.2008.10.029","volume":"430","author":"M Schwartz","year":"2009","unstructured":"Schwartz M.: Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices. Linear Algebra Appl. 430(4), 1364\u20131374 (2009).","journal-title":"Linear Algebra Appl."},{"issue":"8","key":"378_CR26","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I., Barg A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"378_CR27","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2010.2046241","volume":"56","author":"I Tamo","year":"2010","unstructured":"Tamo I., Schwartz M.: Correcting limited-magnitude errors in the rank-modulation scheme. IEEE Trans. Inf. Theory 56(6), 2551\u20132560 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"378_CR28","doi-asserted-by":"crossref","unstructured":"Tamo I., Wang Z., Bruck J.: Long MDS codes for optimal repair bandwidth. In: IEEE International Symposium on Information Theory (ISIT), pp. 1182\u20131186 (2012).","DOI":"10.1109\/ISIT.2012.6283041"},{"issue":"3","key":"378_CR29","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0019-9958(79)90288-2","volume":"42","author":"A Wu","year":"1979","unstructured":"Wu A., Rosenfeld A.: Cellular graph automata. I. Basic concepts, graph property measurement, closure properties. Inf. Control 42(3), 305\u2013329 (1979).","journal-title":"Inf. Control"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0378-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0378-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0378-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:15:53Z","timestamp":1569629753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0378-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,1]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0378-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,7,1]]}}}