{"id":"https://openalex.org/W2160683818","doi":"https://doi.org/10.1109/tit.2009.2023719","title":"Design of Sequence Family Subsets Using a Branch and Bound Technique","display_name":"Design of Sequence Family Subsets Using a Branch and Bound Technique","publication_year":2009,"publication_date":"2009-07-18","ids":{"openalex":"https://openalex.org/W2160683818","doi":"https://doi.org/10.1109/tit.2009.2023719","mag":"2160683818"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2023719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2023719","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/36852/2/134215_134215.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034779594","display_name":"Gregory Cresp","orcid":null},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Gregory Cresp","raw_affiliation_strings":["MRX Technologies Private Limited, Perth, Australia","School of Electrical, Electronic and Computer Engineering, University of Western Australia, Crawley, Australia"],"affiliations":[{"raw_affiliation_string":"MRX Technologies Private Limited, Perth, Australia","institution_ids":[]},{"raw_affiliation_string":"School of Electrical, Electronic and Computer Engineering, University of Western Australia, Crawley, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032908335","display_name":"Hai Huyen Dam","orcid":"https://orcid.org/0000-0002-9244-7533"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Hai Huyen Dam","raw_affiliation_strings":["Department of Mathematics and Statistics, Curtin University of Technology, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Curtin University of Technology, Perth, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073318200","display_name":"Hans\u2010J\u00fcrgen Zepernick","orcid":"https://orcid.org/0000-0003-3604-2766"},"institutions":[{"id":"https://openalex.org/I52719799","display_name":"Blekinge Institute of Technology","ror":"https://ror.org/0093a8w51","country_code":"SE","type":"education","lineage":["https://openalex.org/I52719799"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Hans-J\u00dcrgen Zepernick","raw_affiliation_strings":["Blekinge Institute of Technology, Ronneby, Sweden"],"affiliations":[{"raw_affiliation_string":"Blekinge Institute of Technology, Ronneby, Sweden","institution_ids":["https://openalex.org/I52719799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034779594"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21771082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":"8","first_page":"3847","last_page":"3857"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10575","display_name":"Wireless Communication Networks Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.7183933854103088},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6994753479957581},{"id":"https://openalex.org/keywords/code-division-multiple-access","display_name":"Code division multiple access","score":0.5767771005630493},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5590813159942627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5144074559211731},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5003695487976074},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.475564181804657},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47413158416748047},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4418708086013794},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4412963092327118},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41262632608413696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31334465742111206},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19705244898796082},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.0980370044708252},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09423220157623291},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08704930543899536}],"concepts":[{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.7183933854103088},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6994753479957581},{"id":"https://openalex.org/C47696715","wikidata":"https://www.wikidata.org/wiki/Q233394","display_name":"Code division multiple access","level":2,"score":0.5767771005630493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5590813159942627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5144074559211731},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5003695487976074},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.475564181804657},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47413158416748047},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4418708086013794},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4412963092327118},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41262632608413696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31334465742111206},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19705244898796082},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0980370044708252},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09423220157623291},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08704930543899536},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2009.2023719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2023719","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/36852","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/36852","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/36852/2/134215_134215.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:pure.atira.dk:publications/57d297dd-c8b8-49dd-80d5-4cd53d336772","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/57d297dd-c8b8-49dd-80d5-4cd53d336772","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cresp , G , Zepernick , H J &amp; Dam , H H 2009 , ' Design of Sequence Family Subsets Using a Branch and Bound Technique ' , IEEE Transactions on Information Theory , vol. 55 , no. 8 , pp. 3847-3857 . https://doi.org/10.1109/TIT.2009.2023719","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.873.813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.873.813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://espace.library.curtin.edu.au/cgi-bin/espace.pdf?file%3D/2010/06/25/file_1/134215","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/36852","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/36852","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/36852/2/134215_134215.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2160683818.pdf"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W647564967","https://openalex.org/W1545693521","https://openalex.org/W1556652181","https://openalex.org/W1587448346","https://openalex.org/W1608209878","https://openalex.org/W1984386576","https://openalex.org/W2036201099","https://openalex.org/W2110576705","https://openalex.org/W2123542717","https://openalex.org/W2130970357","https://openalex.org/W2138706041","https://openalex.org/W2140798944","https://openalex.org/W2140811246","https://openalex.org/W2149383589","https://openalex.org/W2156674109","https://openalex.org/W2166647698","https://openalex.org/W2538207836","https://openalex.org/W3123262202","https://openalex.org/W3145128584","https://openalex.org/W3188818167","https://openalex.org/W4233225156","https://openalex.org/W4237723843","https://openalex.org/W4285719527","https://openalex.org/W6633247993","https://openalex.org/W6636303873","https://openalex.org/W6682286772"],"related_works":["https://openalex.org/W2066767660","https://openalex.org/W2138986309","https://openalex.org/W2366206435","https://openalex.org/W2566455368","https://openalex.org/W2389899617","https://openalex.org/W2348534359","https://openalex.org/W1931020284","https://openalex.org/W4319942994","https://openalex.org/W2024470714","https://openalex.org/W2182290077"],"abstract_inverted_index":{"<para":[0],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[2],"The":[3],"number":[4,18],"of":[5,19,40,58,98],"spreading":[6],"sequences":[7,31,43,60],"required":[8],"for":[9],"direct-sequence":[10],"code-division":[11],"multiple-access":[12],"(DS-CDMA)":[13],"systems":[14],"depends":[15],"on":[16,84],"the":[17,23,38,41,56,59,63,67,95],"simultaneous":[20],"users":[21],"in":[22,35,66],"system.":[24,68],"Often":[25],"a":[26,45,52,72],"sequence":[27],"family":[28],"provides":[29],"more":[30],"than":[32],"are":[33,91],"required;":[34],"many":[36],"cases":[37],"selection":[39,50,82],"employed":[42],"is":[44,51,77],"computationally":[46],"intensive":[47],"task.":[48],"This":[49],"key":[53],"consideration,":[54],"as":[55],"properties":[57],"assigned":[61],"affect":[62],"error":[64],"performance":[65,97],"In":[69],"this":[70,81,99],"paper,":[71],"branch":[73],"and":[74],"bound":[75],"algorithm":[76,100],"presented":[78,92],"to":[79,93],"perform":[80],"based":[83],"two":[85],"different":[86],"cost":[87],"functions.":[88],"Numerical":[89],"results":[90],"demonstrate":[94],"improved":[96],"over":[101],"previous":[102],"work.":[103],"</para>":[104]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}