{"id":"https://openalex.org/W1779689801","doi":"https://doi.org/10.1109/icassp.2005.1415895","title":"Achieving the Welch Bound with Difference Sets","display_name":"Achieving the Welch Bound with Difference Sets","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W1779689801","doi":"https://doi.org/10.1109/icassp.2005.1415895","mag":"1779689801"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2005.1415895","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2005.1415895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103019892","display_name":"Pengfei Xia","orcid":"https://orcid.org/0000-0002-5933-537X"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pengfei Xia","raw_affiliation_strings":["Department of ECE, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079373263","display_name":"Shengli Zhou","orcid":"https://orcid.org/0000-0002-5638-0351"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shengli Zhou","raw_affiliation_strings":["Department of ECE, University of Connecticut, Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026758314","display_name":"Georgios B. Giannakis","orcid":"https://orcid.org/0000-0002-0196-0260"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Georgios B. Giannakis","raw_affiliation_strings":["Department of ECE, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"1057","last_page":"1060"},"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.9998000264167786,"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.9998000264167786,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9972000122070312,"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/codebook","display_name":"Codebook","score":0.9783031940460205},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6760321855545044},{"id":"https://openalex.org/keywords/linde\u2013buzo\u2013gray-algorithm","display_name":"Linde\u2013Buzo\u2013Gray algorithm","score":0.5302502512931824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49143922328948975},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4879688620567322},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4523216485977173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.443234920501709},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.42222797870635986},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4212474524974823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4072491526603699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40524783730506897},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38572147488594055},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0934649407863617}],"concepts":[{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.9783031940460205},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6760321855545044},{"id":"https://openalex.org/C93372532","wikidata":"https://www.wikidata.org/wiki/Q6552455","display_name":"Linde\u2013Buzo\u2013Gray algorithm","level":3,"score":0.5302502512931824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49143922328948975},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4879688620567322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4523216485977173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.443234920501709},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42222797870635986},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4212474524974823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4072491526603699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40524783730506897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38572147488594055},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0934649407863617},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2005.1415895","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2005.1415895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.7991","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.7991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.engr.uconn.edu/~shengli/papers/conf05/05icassp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1542496577","https://openalex.org/W1581956570","https://openalex.org/W1634005169","https://openalex.org/W1962152306","https://openalex.org/W1965142549","https://openalex.org/W2035469609","https://openalex.org/W2074863717","https://openalex.org/W2086869478","https://openalex.org/W2109672127","https://openalex.org/W2122644062","https://openalex.org/W2130256523","https://openalex.org/W2130521103","https://openalex.org/W2138548210","https://openalex.org/W2170678594","https://openalex.org/W2950473394","https://openalex.org/W4285719527","https://openalex.org/W6634818736","https://openalex.org/W6678078163"],"related_works":["https://openalex.org/W2096936443","https://openalex.org/W2081863301","https://openalex.org/W2352648934","https://openalex.org/W1977098967","https://openalex.org/W2365109233","https://openalex.org/W145510127","https://openalex.org/W2374856816","https://openalex.org/W2378932494","https://openalex.org/W2352292447","https://openalex.org/W2017514583"],"abstract_inverted_index":{"Consider":[0],"a":[1,9,13,82],"codebook":[2,18],"containing":[3],"N":[4],"unit-norm":[5],"complex":[6],"vectors":[7],"in":[8,43],"K-dimensional":[10],"space.":[11],"In":[12],"number":[14],"of":[15],"applications,":[16],"the":[17,21,72,87],"that":[19,92],"minimizes":[20],"maximal":[22],"cross-correlation":[23],"amplitude":[24],"(I/sub":[25],"max/)":[26],"is":[27,93],"often":[28],"desirable.":[29],"Relying":[30],"on":[31,63,71,86],"tools":[32],"from":[33],"combinatorial":[34],"design":[35],"theory,":[36],"we":[37,55],"construct":[38],"analytically":[39],"optimal":[40],"codebooks":[41],"meeting,":[42],"certain":[44],"cases,":[45],"Welch's":[46],"lower":[47,84],"bound.":[48],"When":[49],"analytical":[50],"constructions":[51],"are":[52],"not":[53],"available,":[54],"develop":[56],"an":[57],"efficient":[58],"numerical":[59],"search":[60],"method":[61],"based":[62],"Lloyd's":[64],"algorithm,":[65],"which":[66],"leads":[67],"to":[68],"considerable":[69],"improvement":[70],"achieved":[73],"I/sub":[74,90],"max/":[75,91],"over":[76],"existing":[77],"alternatives.":[78],"We":[79],"also":[80],"derive":[81],"composite":[83],"bound":[85],"minimum":[88],"achievable":[89],"effective":[94],"for":[95],"any":[96],"N.":[97]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":11},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}