{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:21Z","timestamp":1770972381749,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T00:00:00Z","timestamp":1498694400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10623-017-0381-1","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T04:32:40Z","timestamp":1498710760000},"page":"1095-1111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Constructing permutation arrays from groups"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2866-6766","authenticated-orcid":false,"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Avi","family":"Levy","sequence":"additional","affiliation":[]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"381_CR1","doi-asserted-by":"crossref","unstructured":"Bereg S., Morales L., Sudborough I.H.: Parallel and sequential partition and extension techniques. Manuscript, The University of Texas Dallas (2016).","DOI":"10.1109\/CISS.2017.7926083"},{"issue":"3","key":"381_CR2","doi-asserted-by":"crossref","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."},{"issue":"1","key":"381_CR3","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.D., Deza M.: Coding with permutations. Inform. Control 43(1), 1\u201319 (1979).","journal-title":"Inform. Control"},{"key":"381_CR4","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation Groups","author":"P Cameron","year":"1999","unstructured":"Cameron P.: Permutation Groups. London Mathematical Society Student TextsCambridge University Press, Cambridge (1999)."},{"issue":"1\u20133","key":"381_CR5","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."},{"issue":"6","key":"381_CR6","doi-asserted-by":"crossref","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. Inform. Theory 50(6), 1289\u20131291 (2004).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR7","volume-title":"Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups","author":"JH Conway","year":"1985","unstructured":"Conway J.H., Curtis R.T., Norton S.P., Parker R.A., Wilson R.A.: Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups. Clarendon Press, Oxford (1985)."},{"key":"381_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"J Dixon","year":"1996","unstructured":"Dixon J., Mortimer B.: Permutation Groups. Springer, New York (1996)."},{"key":"381_CR9","volume-title":"Abstract Algebra","author":"DS Dummit","year":"1999","unstructured":"Dummit D.S., Foote R.M.: Abstract Algebra, 2nd edn. Wiley, New York (1999).","edition":"2"},{"issue":"3","key":"381_CR10","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. Comb. Theory Ser. A 22(3), 352\u2013360 (1977).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"381_CR11","doi-asserted-by":"crossref","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-Varshamov bound for permutation codes. IEEE Trans. Inform. Theory 59(5), 3059\u20133063 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"381_CR12","volume-title":"Topics in Algebra","author":"IN Herstein","year":"1975","unstructured":"Herstein I.N.: Topics in Algebra, 2nd edn. Wiley, New York (1975).","edition":"2"},{"issue":"1849","key":"381_CR13","doi-asserted-by":"crossref","first-page":"3199","DOI":"10.1098\/rsta.2006.1885","volume":"364","author":"S Huczynska","year":"2006","unstructured":"Huczynska S.: Powerline communication and the 36 officers problem. Philos. Trans. R. Soc. Lond. A 364(1849), 3199\u20133214 (2006).","journal-title":"Philos. Trans. R. Soc. Lond. A"},{"issue":"3","key":"381_CR14","doi-asserted-by":"crossref","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":"381_CR15","unstructured":"Janiszczak I., Staszewski R.: An improved bound for permutation arrays of length 10. Technical Report\u00a04, Institute for Experimental Mathematics, University Duisburg-Essen (2008)."},{"key":"381_CR16","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997).","edition":"2"},{"key":"381_CR17","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland\/Elsevier, Amsterdam (1977)."},{"key":"381_CR18","unstructured":"Passman D.: Sharp transitivity. In: Permutation Groups. Benjamin, Inc., New York (1968)."},{"key":"381_CR19","doi-asserted-by":"crossref","unstructured":"Pavlidou N., Vinck A.H., Yazdani J., Honary B.: Power lines communications: state of the art and future trends. IEEE Commun. Mag. 34\u201340 (2003).","DOI":"10.1109\/MCOM.2003.1193972"},{"key":"381_CR20","volume-title":"Handbook of Coding Theory","year":"1998","unstructured":"Pless V.S., H W.C. (eds.): Handbook of Coding Theory. North-Holland\/Elsevier, Amsterdam (1998)."},{"issue":"2","key":"381_CR21","doi-asserted-by":"crossref","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":"381_CR22","unstructured":"Table of cosets. http:\/\/www.utdallas.edu\/~sxb027100\/cosets ."},{"key":"381_CR23","unstructured":"Yang L., Chen K., Yuan L.: New constructions of permutation arrays. arXiv:abs\/0801.3987 (2008)."},{"key":"381_CR24","unstructured":"Yang L., Chen K., Yuan L.: New lower bounds on sizes of permutation arrays. arXiv:abs\/0801.3986 (2008)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0381-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0381-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0381-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T11:17:39Z","timestamp":1569583059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0381-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,29]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0381-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,29]]}}}