{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T17:07:44Z","timestamp":1706807264568},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","funder":[{"name":"CONACyT","award":["238469"],"award-info":[{"award-number":["238469"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> A covering array CA([Formula: see text]) of strength [Formula: see text] and order [Formula: see text] is an [Formula: see text] array over [Formula: see text] with the property that every [Formula: see text] subarray covers all members of [Formula: see text] at least once. When the value of [Formula: see text] is the minimum possible it is named as the covering array number (CAN) i.e. [Formula: see text]. Two CAs are isomorphic if one of them can be derived from the other by a combination of a row permutation, a column permutation, and a symbol permutation in a subset of columns. Isomorphic CAs have equivalent coverage properties, and can be considered as the same CA; the truly distinct CAs are those which are non-isomorphic among them. An interesting and hard problem is to construct all the non-isomorphic CAs that exist for a particular combination of the parameters [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text]. We constructed the non-isomorphic CAs for 70 combinations of values of the parameters [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text], the results allow us to determine CAN(3,13,2) =16, CAN(3,14,2) =16, CAN(3,15,2) =17, CAN(3,16,2) =17, and CAN(2,10,3) =14. The exact lower bound for these covering arrays numbers had not been determined before either by computational search or by algebraic analysis. <\/jats:p>","DOI":"10.1142\/s1793830916500336","type":"journal-article","created":{"date-parts":[[2016,3,6]],"date-time":"2016-03-06T22:31:17Z","timestamp":1457303477000},"page":"1650033","source":"Crossref","is-referenced-by-count":7,"title":["Construction of non-isomorphic covering arrays"],"prefix":"10.1142","volume":"08","author":[{"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[{"name":"CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[{"name":"CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S1793830916500336BIB004","volume-title":"Experimental Design for Combinatorial and High Throughput Materials Development","author":"Cawse J. N.","year":"2003"},{"key":"S1793830916500336BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.06.013"},{"key":"S1793830916500336BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.03.008"},{"key":"S1793830916500336BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25036-0_10"},{"key":"S1793830916500336BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.029"},{"key":"S1793830916500336BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-7094-9"},{"key":"S1793830916500336BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018457"},{"key":"S1793830916500336BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90098-8"},{"key":"S1793830916500336BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.253"},{"key":"S1793830916500336BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00291-9"},{"key":"S1793830916500336BIB019","volume-title":"Foundations of Probability","author":"R\u00e9nyi A.","year":"1970"},{"key":"S1793830916500336BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.024"},{"key":"S1793830916500336BIB021","doi-asserted-by":"publisher","DOI":"10.1104\/pp.010683"},{"key":"S1793830916500336BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2008.02.034"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:05:00Z","timestamp":1565125500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":14,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S1793830916500336"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500336","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}