New lower bounds for permutation arrays using contraction. Bereg, S., Miller, Z., Mojica, L. G., Morales, L., & Sudborough, I. H. Des. Codes Cryptogr., 87(9):2105-2128, 2019.
Link
Paper bibtex @article{journals/dcc/BeregMMMS19,
added-at = {2019-09-05T00:00:00.000+0200},
author = {Bereg, Sergey and Miller, Zevi and Mojica, Luis Gerardo and Morales, Linda and Sudborough, Ivan Hal},
biburl = {https://www.bibsonomy.org/bibtex/2cc609a2e31c734b46884d4d4d3774cca/dblp},
ee = {https://doi.org/10.1007/s10623-019-00607-y},
interhash = {e9a60f8eea5c5bea8597f32b030e5c76},
intrahash = {cc609a2e31c734b46884d4d4d3774cca},
journal = {Des. Codes Cryptogr.},
keywords = {dblp},
number = 9,
pages = {2105-2128},
timestamp = {2019-09-06T11:40:21.000+0200},
title = {New lower bounds for permutation arrays using contraction.},
url = {http://dblp.uni-trier.de/db/journals/dcc/dcc87.html#BeregMMMS19},
volume = 87,
year = 2019
}
Downloads: 0
{"_id":"NHSfBbvH3HM9z3CEX","bibbaseid":"bereg-miller-mojica-morales-sudborough-newlowerboundsforpermutationarraysusingcontraction-2019","author_short":["Bereg, S.","Miller, Z.","Mojica, L. G.","Morales, L.","Sudborough, I. H."],"bibdata":{"bibtype":"article","type":"article","added-at":"2019-09-05T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Bereg"],"firstnames":["Sergey"],"suffixes":[]},{"propositions":[],"lastnames":["Miller"],"firstnames":["Zevi"],"suffixes":[]},{"propositions":[],"lastnames":["Mojica"],"firstnames":["Luis","Gerardo"],"suffixes":[]},{"propositions":[],"lastnames":["Morales"],"firstnames":["Linda"],"suffixes":[]},{"propositions":[],"lastnames":["Sudborough"],"firstnames":["Ivan","Hal"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2cc609a2e31c734b46884d4d4d3774cca/dblp","ee":"https://doi.org/10.1007/s10623-019-00607-y","interhash":"e9a60f8eea5c5bea8597f32b030e5c76","intrahash":"cc609a2e31c734b46884d4d4d3774cca","journal":"Des. Codes Cryptogr.","keywords":"dblp","number":"9","pages":"2105-2128","timestamp":"2019-09-06T11:40:21.000+0200","title":"New lower bounds for permutation arrays using contraction.","url":"http://dblp.uni-trier.de/db/journals/dcc/dcc87.html#BeregMMMS19","volume":"87","year":"2019","bibtex":"@article{journals/dcc/BeregMMMS19,\n added-at = {2019-09-05T00:00:00.000+0200},\n author = {Bereg, Sergey and Miller, Zevi and Mojica, Luis Gerardo and Morales, Linda and Sudborough, Ivan Hal},\n biburl = {https://www.bibsonomy.org/bibtex/2cc609a2e31c734b46884d4d4d3774cca/dblp},\n ee = {https://doi.org/10.1007/s10623-019-00607-y},\n interhash = {e9a60f8eea5c5bea8597f32b030e5c76},\n intrahash = {cc609a2e31c734b46884d4d4d3774cca},\n journal = {Des. Codes Cryptogr.},\n keywords = {dblp},\n number = 9,\n pages = {2105-2128},\n timestamp = {2019-09-06T11:40:21.000+0200},\n title = {New lower bounds for permutation arrays using contraction.},\n url = {http://dblp.uni-trier.de/db/journals/dcc/dcc87.html#BeregMMMS19},\n volume = 87,\n year = 2019\n}\n\n","author_short":["Bereg, S.","Miller, Z.","Mojica, L. G.","Morales, L.","Sudborough, I. H."],"key":"journals/dcc/BeregMMMS19","id":"journals/dcc/BeregMMMS19","bibbaseid":"bereg-miller-mojica-morales-sudborough-newlowerboundsforpermutationarraysusingcontraction-2019","role":"author","urls":{"Link":"https://doi.org/10.1007/s10623-019-00607-y","Paper":"http://dblp.uni-trier.de/db/journals/dcc/dcc87.html#BeregMMMS19"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Hal?items=1000","dataSources":["Jy4SyfFmJfDm4DM2r"],"keywords":["dblp"],"search_terms":["new","lower","bounds","permutation","arrays","using","contraction","bereg","miller","mojica","morales","sudborough"],"title":"New lower bounds for permutation arrays using contraction.","year":2019}