{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T08:19:51Z","timestamp":1765700391012,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T00:00:00Z","timestamp":1470182400000},"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":[[2017,6]]},"DOI":"10.1007\/s10623-016-0263-y","type":"journal-article","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T06:06:22Z","timestamp":1470204382000},"page":"661-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Extending permutation arrays: improving MOLS bounds"],"prefix":"10.1007","volume":"83","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Linda","family":"Morales","sequence":"additional","affiliation":[]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,3]]},"reference":[{"key":"263_CR1","unstructured":"Bereg S., Morales L., Sudborough I.: Table of lower bounds for $$M(n,n-1)$$ M ( n , n - 1 ) . http:\/\/www.utdallas.edu\/~sxb027100\/soft\/permutation-arrays\/n-1\/ (2016)."},{"key":"263_CR2","unstructured":"Bereg S., Morales L., Sudborough I.: PAs exhibiting results from partition and extension. http:\/\/www.utdallas.edu\/~sxb027100\/soft\/permutation-arrays\/n-1\/data.zip (2016)."},{"key":"263_CR3","doi-asserted-by":"crossref","unstructured":"Beth T.: Eine Bemerkung zur Absch\u00e4tzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren. Abh. Math. Sem. Hamburg. 53, 284\u2013288 (1983).","DOI":"10.1007\/BF02941326"},{"key":"263_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":"263_CR5","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall\/CRC, New York (2006).","DOI":"10.1201\/9781420010541"},{"key":"263_CR6","doi-asserted-by":"crossref","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, 1289\u20131291 (2004).","DOI":"10.1109\/TIT.2004.828150"},{"key":"263_CR7","doi-asserted-by":"crossref","unstructured":"Deza M., Vanstone S.A.: Bounds for permutation arrays. J. Stat. Plan. Inference 2, 197\u2013209 (1978).","DOI":"10.1016\/0378-3758(78)90008-3"},{"key":"263_CR8","doi-asserted-by":"crossref","unstructured":"Frankl P., Deza M.: On the maximum number of permutations with given maximal or minimal distance. J. Comb. Theory A 22, 352\u2013360 (1977).","DOI":"10.1016\/0097-3165(77)90009-7"},{"key":"263_CR9","doi-asserted-by":"crossref","unstructured":"Gao F., Yang Y., Ge G.: An improvement on the Gilbert-Varshamov bound for permutation codes. IEEE Trans. Inf. Theory 59, 3059\u20133063 (2013).","DOI":"10.1109\/TIT.2013.2237945"},{"key":"263_CR10","doi-asserted-by":"crossref","unstructured":"Huang Y.-Y., Tsai S.-C., Wu H.-L.: On the construction of permutation arrays via mappings from binary vectors to permutations. Des. Codes Cryptogr. 40, 139\u2013155 (2006).","DOI":"10.1007\/s10623-006-0003-9"},{"key":"263_CR11","doi-asserted-by":"crossref","unstructured":"Huczynska S.: Powerline communication and the 36 officers problem. Philos. Trans. R. Soc. Lond. A 364, 3199\u20133214 (2006).","DOI":"10.1098\/rsta.2006.1885"},{"key":"263_CR12","unstructured":"Janiszczak I., Staszewski R.: An Improved Bound for Permutation Arrays of Length 10. Technical Report\u00a04. Institute for Experimental Mathematics, University Duisburg-Essen, Essen (2008)."},{"key":"263_CR13","doi-asserted-by":"crossref","unstructured":"Janiszczak I., Lempken W., \u00d6sterg\u00e5rd P.R.J., Staszewski R.: Permutation codes invariant under isometries. Des. Codes Cryptogr. 75, 497\u2013507 (2015).","DOI":"10.1007\/s10623-014-9930-z"},{"key":"263_CR14","doi-asserted-by":"crossref","unstructured":"Lin T.-T., Tsai S.-C., Tzeng W.-G.: Efficient encoding and decoding with permutation arrays. In: IEEE International Symposium on Information Theory (ISIT\u201908), pp. 211\u2013214 (2008).","DOI":"10.1109\/ISIT.2008.4594978"},{"key":"263_CR15","unstructured":"Nguyen Q.T.: Transitivity and hamming distance of permutation arrays. PhD thesis, University of Texas at Dallas Richardson, TX (2013)."},{"key":"263_CR16","unstructured":"Passman D.: Permutation Groups. Benjamin Inc, New York (1968)."},{"key":"263_CR17","doi-asserted-by":"crossref","unstructured":"Pavlidou N., Vinck A.H., Yazdani J., Honary B.: Power line communications: state of the art and future trends. IEEE Commun. Mag. 41, 34\u201340 (2003).","DOI":"10.1109\/MCOM.2003.1193972"},{"key":"263_CR18","doi-asserted-by":"crossref","unstructured":"Quistorff J.: A new nonexistence result for sharply multiply transitive permutation sets. Discret. Math. 288, 185\u2013186 (2004).","DOI":"10.1016\/j.disc.2004.08.001"},{"key":"263_CR19","doi-asserted-by":"crossref","unstructured":"Rotman J.J.: An Introduction to the Theory of Groups, 4th edn. Springer, New York (1995).","DOI":"10.1007\/978-1-4612-4176-8"},{"key":"263_CR20","doi-asserted-by":"crossref","unstructured":"Smith D.H., Montemanni R.: A new table of permutation codes. Des. Codes Cryptogr. 63, 241\u2013253 (2012).","DOI":"10.1007\/s10623-011-9551-8"},{"key":"263_CR21","unstructured":"The Sage Developers: Mutually Orthogonal Latin Squares (MOLS). http:\/\/doc.sagemath.org\/html\/en\/reference\/combinat\/sage\/combinat\/designs\/latin_squares.html ."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0263-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0263-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0263-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0263-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T11:49:06Z","timestamp":1749037746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0263-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0263-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,8,3]]}}}