{"id":"https://openalex.org/W4289655337","doi":"https://doi.org/10.1109/isit50566.2022.9834893","title":"An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlation","display_name":"An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlation","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655337","doi":"https://doi.org/10.1109/isit50566.2022.9834893"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834893","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834893","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5100384099","display_name":"Zilong Wang","orcid":"https://orcid.org/0000-0002-1525-3356"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zilong Wang","raw_affiliation_strings":["Xidian University,State Key Laboratory of Integrated Service Networks,Xi’an,China,710071"],"affiliations":[{"raw_affiliation_string":"Xidian University,State Key Laboratory of Integrated Service Networks,Xi’an,China,710071","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100428481","display_name":"Qian Chen","orcid":"https://orcid.org/0000-0002-6956-8185"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qian Chen","raw_affiliation_strings":["Xidian University,State Key Laboratory of Integrated Service Networks,Xi’an,China,710071"],"affiliations":[{"raw_affiliation_string":"Xidian University,State Key Laboratory of Integrated Service Networks,Xi’an,China,710071","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036636567","display_name":"Guang Gong","orcid":"https://orcid.org/0000-0003-2684-9259"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Guang Gong","raw_affiliation_strings":["University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Ontario,Canada,N2L 3G1"],"affiliations":[{"raw_affiliation_string":"University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Ontario,Canada,N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100384099"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06280974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"532","last_page":"535"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6052557229995728},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.596112847328186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4926305413246155},{"id":"https://openalex.org/keywords/correlation","display_name":"Correlation","score":0.44737306237220764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40161722898483276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3693930506706238},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14220300316810608},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08034244179725647}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6052557229995728},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.596112847328186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4926305413246155},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.44737306237220764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40161722898483276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3693930506706238},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14220300316810608},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08034244179725647},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834893","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834893","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1980201978","https://openalex.org/W2006296282","https://openalex.org/W2032685643","https://openalex.org/W2066530892","https://openalex.org/W2089189820","https://openalex.org/W2116211855","https://openalex.org/W2129792960","https://openalex.org/W2130489129","https://openalex.org/W2131972975","https://openalex.org/W2132830672","https://openalex.org/W2138548210","https://openalex.org/W2138706041","https://openalex.org/W2155416100","https://openalex.org/W2160674712","https://openalex.org/W2165458930","https://openalex.org/W2169756076","https://openalex.org/W2245631212","https://openalex.org/W2791849547","https://openalex.org/W3081287412","https://openalex.org/W3195363332","https://openalex.org/W4243205024"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"The":[0],"set":[1,48,76,96,108],"of":[2,23,50,78,94,98,117],"perfect":[3,24,64,99,119],"sequences":[4,25,65,100,120],"with":[5,101],"optimal":[6,21,88,102],"cross-correlation":[7],"has":[8],"applications":[9],"in":[10,33,66,121],"communication":[11],"and":[12,40,104],"radar":[13],"systems.":[14],"Many":[15],"different":[16],"constructions,":[17],"which":[18],"are":[19,85],"called":[20,87],"sets":[22],"according":[26],"to":[27,60],"Sarwate":[28,67],"bound,":[29],"have":[30],"been":[31],"studied":[32,91],"the":[34,47,57,75,92,95,107,115,118],"literature.":[35],"However,":[36],"Song":[37],"et":[38,42],"al.":[39,43],"Zhang":[41],"recently":[44],"showed":[45,105],"that":[46,106],"size":[49,61,77,97,109],"these":[51,79],"constructions":[52,80],"can":[53],"be":[54,111],"improved,":[55],"since":[56],"term":[58],"related":[59],"vanishes":[62],"for":[63],"bound.":[68],"Until":[69],"now,":[70],"we":[71],"don\u2019t":[72],"know":[73],"whether":[74],"is":[81],"optimal,":[82],"though":[83],"they":[84],"all":[86],"sets.":[89],"We":[90],"problem":[93],"cross-correlation,":[103],"must":[110],"upper":[112],"bounded":[113],"by":[114],"length":[116],"this":[122],"paper.":[123]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}