{"id":"https://openalex.org/W4415368138","doi":"https://doi.org/10.1109/isit63088.2025.11195263","title":"Lower Bounds on the Size of Orthogonal Arrays","display_name":"Lower Bounds on the Size of Orthogonal Arrays","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368138","doi":"https://doi.org/10.1109/isit63088.2025.11195263"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101810218","display_name":"Smarajit Das","orcid":"https://orcid.org/0000-0001-6260-6129"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Smarajit Das","raw_affiliation_strings":["IIT Guwahati,Department of Electronics and Electrical Engineering,Assam,India"],"affiliations":[{"raw_affiliation_string":"IIT Guwahati,Department of Electronics and Electrical Engineering,Assam,India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101810218"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31875856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9379000067710876,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9379000067710876,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9323999881744385,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/orthogonal-array","display_name":"Orthogonal array","score":0.7555999755859375},{"id":"https://openalex.org/keywords/orthogonal-matrix","display_name":"Orthogonal matrix","score":0.6524999737739563},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5884000062942505},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.542900025844574},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45179998874664307},{"id":"https://openalex.org/keywords/orthogonality","display_name":"Orthogonality","score":0.42890000343322754},{"id":"https://openalex.org/keywords/orthogonal-transformation","display_name":"Orthogonal transformation","score":0.3871999979019165},{"id":"https://openalex.org/keywords/orthogonal-basis","display_name":"Orthogonal basis","score":0.38519999384880066}],"concepts":[{"id":"https://openalex.org/C42632107","wikidata":"https://www.wikidata.org/wiki/Q2031860","display_name":"Orthogonal array","level":3,"score":0.7555999755859375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6693999767303467},{"id":"https://openalex.org/C44292817","wikidata":"https://www.wikidata.org/wiki/Q333871","display_name":"Orthogonal matrix","level":3,"score":0.6524999737739563},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5884000062942505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5486999750137329},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45179998874664307},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4242999851703644},{"id":"https://openalex.org/C54940322","wikidata":"https://www.wikidata.org/wiki/Q3997740","display_name":"Orthogonal transformation","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C187064257","wikidata":"https://www.wikidata.org/wiki/Q3306808","display_name":"Orthogonal basis","level":2,"score":0.38519999384880066},{"id":"https://openalex.org/C135925592","wikidata":"https://www.wikidata.org/wiki/Q2637908","display_name":"Orthogonal functions","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36649999022483826},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.3418000042438507},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C41106240","wikidata":"https://www.wikidata.org/wiki/Q526790","display_name":"Skew-symmetric matrix","level":5,"score":0.3147999942302704},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C10628310","wikidata":"https://www.wikidata.org/wiki/Q619458","display_name":"Orthogonal polynomials","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2033633322","https://openalex.org/W2069788171","https://openalex.org/W2974531952"],"related_works":[],"abstract_inverted_index":{"An":[0],"(<tex":[1],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,13,21,30,41,45,50,90,100,106,111,126],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N,":[3],"n,":[4],"s,":[5],"t$</tex>)":[6],"orthogonal":[7,55,79,96,157],"array":[8,56,97],"(OA)":[9],"is":[10,57,81,85,136],"an":[11,19,58,95,109],"<tex":[12,20,29,40,44,49,89,99,105,110,125],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N":[14],"\\times":[15,52],"n$</tex>":[16,33],"matrix":[17],"over":[18,108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$s$</tex>-ary":[22,112],"alphabet,":[23],"if":[24],"for":[25,155],"any":[26],"choice":[27],"of":[28,61,69,92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$t":[31],"\\leq":[32],"columns,":[34],"the":[35,67,82,86,123,130,132,151],"resulting":[36],"sub-array":[37],"contains":[38],"each":[39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$t$</tex>-tuple":[42],"exactly":[43],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda$</tex>":[46],"times":[47],"where":[48],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda":[51],"s^{t}=N$</tex>.":[53],"The":[54,74],"important":[59,76],"object":[60],"study":[62],"in":[63,94,129],"many":[64],"disciplines,":[65],"namely":[66],"design":[68],"experiments,":[70],"error-correcting":[71],"codes,":[72],"etc.":[73],"most":[75],"problem":[77],"about":[78],"arrays":[80],"following:":[83],"What":[84],"minimum":[87],"number":[88,124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[91,127],"rows":[93],"with":[98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[101],"columns":[102],"and":[103,119,146],"strength":[104],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$t$</tex>":[107],"alphabet?":[113],"Although":[114],"there":[115],"are":[116],"several":[117],"lower":[118,153],"upper":[120],"bounds":[121],"on":[122],"known":[128],"literature,":[131],"gap":[133],"between":[134],"them":[135,148],"significantly":[137],"large.":[138],"In":[139],"this":[140],"work,":[141],"we":[142],"derive":[143],"new":[144],"inequalities":[145],"use":[147],"to":[149],"improve":[150],"existing":[152],"bound":[154],"some":[156],"arrays.":[158]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}