{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:35:34Z","timestamp":1759336534258,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:00:00Z","timestamp":1550707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006115","name":"Institute for Research in Fundamental Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006115","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":[[2019,10]]},"DOI":"10.1007\/s10623-019-00621-0","type":"journal-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T01:07:13Z","timestamp":1550711233000},"page":"2335-2340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A note on good permutation codes from Reed\u2013Solomon codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6876-307X","authenticated-orcid":false,"given":"R.","family":"Sobhani","sequence":"first","affiliation":[]},{"given":"A.","family":"Abdollahi","sequence":"additional","affiliation":[]},{"given":"J.","family":"Bagherian","sequence":"additional","affiliation":[]},{"given":"M.","family":"Khatami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"issue":"5","key":"621_CR1","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s10623-017-0381-1","volume":"86","author":"S Bereg","year":"2018","unstructured":"Bereg S., Levy A., Sudborough I.H.: Constructing permutation arrays from groups. Des. Codes Cryptogr. 86(5), 1095\u20131111 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"621_CR2","doi-asserted-by":"crossref","unstructured":"Bereg S., Mojica L.G., Morales L., Sudborough H.: Parallel partition and extension: Better permutation arrays for hamming distances. In: Conference on Information Science and Systems (CISS), pp. 1\u20136. IEEE (2017).","DOI":"10.1109\/CISS.2017.7926083"},{"issue":"3","key":"621_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10623-016-0263-y","volume":"83","author":"S Bereg","year":"2017","unstructured":"Bereg S., Morales L., Sudborough I.H.: Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3), 661\u2013683 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"621_CR4","unstructured":"Berger T.P.: A direct proof for the automorphism group of Reed\u2013Solomon codes. In: Cohen G., Charpin P. (eds.) Proc. Eurocode 90. Lecture Notes in Computer Science, vol. 514, pp. 21\u201329. Springer, Berlin (1991)."},{"issue":"1\u20133","key":"621_CR5","doi-asserted-by":"publisher","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."},{"issue":"6","key":"621_CR6","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn C.J., Kl\u00f8ve T., Ling A.C.H.: Permutation arrays for powerline communication and mutually orthogonal latin squares. IEEE Trans. Inf. Theory 50(6), 1289\u20131291 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"621_CR7","first-page":"5","volume":"145","author":"DR Torre de la","year":"2000","unstructured":"de la Torre D.R., Colbourn C.J., Ling A.C.H.: An application of permutation arrays to block ciphers. Cong. Numer. 145, 5\u20137 (2000).","journal-title":"Cong. Numer."},{"key":"621_CR8","doi-asserted-by":"publisher","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. Inference 2, 197\u2013209 (1978).","journal-title":"J. Stat. Plan. Inference"},{"key":"621_CR9","volume-title":"Linear Groups with an Exposition of the Galois Field Theory","author":"LE Dickson","year":"1958","unstructured":"Dickson L.E.: Linear Groups with an Exposition of the Galois Field Theory. Dover, New York (1958)."},{"issue":"1","key":"621_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0097-3165(87)90060-4","volume":"44","author":"A D\u00fcr","year":"1987","unstructured":"D\u00fcr A.: The automorphism groups of Reed\u2013Solomon codes. J. Comb. Theory Ser. A 44(1), 69\u201382 (1987).","journal-title":"J. Comb. Theory Ser. A"},{"key":"621_CR11","unstructured":"Ferreira H.C., Vinck A.J.H.: Inference cancellation with permutation trellis arrays. In: Proceedings of IEEE Vehicular Technology Conference, Boston, pp. 2401\u20132407 (2000)."},{"issue":"3","key":"621_CR12","doi-asserted-by":"publisher","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. Comb. Theory Ser. A 22(3), 352\u2013360 (1977).","journal-title":"J. Comb. Theory Ser. A"},{"key":"621_CR13","series-title":"The Springer International Series in Engineering and Computer Science (Communications and Information Theory)","volume-title":"Communications, Information and Network Security","author":"S Gao","year":"2003","unstructured":"Gao S.: A new algorithm for decoding Reed\u2013Solomon codes. In: Bhargava V.K., Poor H.V., Tarokh V., Yoon S. (eds.) Communications, Information and Network Security, vol. 712. The Springer International Series in Engineering and Computer Science (Communications and Information Theory)Springer, Boston (2003)."},{"issue":"2","key":"621_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/0109020","volume":"9","author":"D Gorenstein","year":"1961","unstructured":"Gorenstein D., Zierler N.: A class of error correcting codes in \n                    \n                      \n                    \n                    $$p^m$$\n                    \n                      \n                        \n                          p\n                          m\n                        \n                      \n                    \n                   symbols. J. Soc. Ind. Appl. Math. 9(2), 207\u2013214 (1961).","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"5","key":"621_CR15","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1109\/TIT.2013.2237945","volume":"59","author":"F Gao","year":"2013","unstructured":"Gao F., Yang Y., Ge G.: An improvement on the Gilbert\u2013Varshamov bound for permutation codes. IEEE Trans. Inf. Theory 59(5), 3059\u20133063 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"621_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-014-9930-z","volume":"75","author":"I Janiszczak","year":"2015","unstructured":"Janiszczak I., Lempken W., \u00d6sterg\u00e5rd P.R.J., Staszewski R.: Permutation codes invariant under isometries. Des. Codes Cryptogr. 75(3), 497\u2013507 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"621_CR17","unstructured":"Janiszczak I., Staszewski R.: An improved bound for permutation arrays of length 10. Technical Report 4, Institute for Experimental Mathematics, University Duisburg-Essen (2008)."},{"key":"621_CR18","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.ffa.2010.07.001","volume":"16","author":"J Li","year":"2010","unstructured":"Li J., Chandler D.B., Xiang Q.: Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2. Finite Fields Appl. 16, 406\u2013419 (2010).","journal-title":"Finite Fields Appl."},{"issue":"3","key":"621_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/00029890.1988.11971991","volume":"95","author":"R Lidl","year":"1988","unstructured":"Lidl R., Mullen G.L.: When does a polynomial over a finite field permute the elements of the field? Am. Math. Mon. 95(3), 243\u2013246 (1988).","journal-title":"Am. Math. Mon."},{"issue":"1","key":"621_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.2307\/2324822","volume":"100","author":"R Lidl","year":"1993","unstructured":"Lidl R., Mullen G.L.: When does a polynomial over a finite field permute the elements of the field? II. Am. Math. Mon. 100(1), 71\u201374 (1993).","journal-title":"Am. Math. Mon."},{"key":"621_CR21","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT\u201315","author":"JL Massey","year":"1969","unstructured":"Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory IT\u201315, 122\u2013127 (1969).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"621_CR22","unstructured":"Mojica L.G.: Permutation arrays with large Hamming distance, Ph.D. Thesis, University of Texas (2017)."},{"key":"621_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/b15006","volume-title":"Handbook of Finite Fields","author":"GL Mullen","year":"2013","unstructured":"Mullen G.L., Panario D.: Handbook of Finite Fields. CRC Press, Hoboken (2013). Chapter 8."},{"key":"621_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCOM.2003.1193972","volume":"41","author":"N Pavlidou","year":"2003","unstructured":"Pavlidou N., Vinck A.J.H., Yazdani J., Honary B.: Power line communications: state of the art and future trends. IEEE Commun. Mag. 41, 34\u201340 (2003).","journal-title":"IEEE Commun. Mag."},{"issue":"2","key":"621_CR25","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed I.S., Solomon G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960).","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"621_CR26","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ffa.2012.12.003","volume":"20","author":"CJ Shallue","year":"2013","unstructured":"Shallue C.J., Wanless I.M.: Permutation polynomials and orthomorphism polynomials of degree six. Finite Fields Appl. 20, 84\u201392 (2013).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"621_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10623-011-9551-8","volume":"63","author":"DH Smith","year":"2012","unstructured":"Smith D.H., Montemanni R.: A new table of permutation codes. Des. Codes Cryptogr. 63(2), 241\u2013253 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"621_CR28","unstructured":"Source files of the codes: \n                    http:\/\/sciold.ui.ac.ir\/~r.sobhani\/NPA\n                    \n                  . Last accessed 21 July 2018."},{"issue":"1","key":"621_CR29","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M Sudan","year":"1997","unstructured":"Sudan M.: Decoding of Reed Solomon codes beyond the error-correction bound. J. Complex. 13(1), 180\u2013193 (1997).","journal-title":"J. Complex."},{"issue":"1","key":"621_CR30","first-page":"45","volume":"54","author":"AJH Vinck","year":"2000","unstructured":"Vinck A.J.H.: Coded modulation for powerline communications. AE\u00dc Int. J. Electron. Commun. 54(1), 45\u201349 (2000).","journal-title":"AE\u00dc Int. J. Electron. Commun."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00621-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00621-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00621-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T19:15:33Z","timestamp":1582226133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00621-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,21]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00621-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,2,21]]},"assertion":[{"value":"9 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}