Efficient exhaustive search for binary complementary code sets
Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight nee...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 6 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Coxson, Gregory E. Russo, Jon C. |
| description | Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined. |
| doi_str_mv | 10.1109/CISS.2013.6552317 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6552317</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6552317</ieee_id><sourcerecordid>6552317</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-fb268886abfa24341ae9401366bd8bac0158e0e62bb67885d7c4b6db3c3a399b3</originalsourceid><addsrcrecordid>eNo1j89KAzEYxCMiqHUfQLzsC-yaf_sluQiy1FooeGgL3kqS_UIj3bZsVtG3N9J6Gn4wM8wQcs9ozRg1j-18uaw5ZaKGpuGCqQtyyyQokcG8X5LCKP3PCq5JkdIHpTRngRtxQ56mIUQfcT-W-L21n2mMX1gmtIPfluEwlC7u7fBT-kN_3GGffSfq_kxjuiNXwe4SFmedkPXLdNW-Vou32bx9XlSRMz1WwXHQWoN1wXIpJLNoZB4N4DrtrKes0UgRuHOgtG465aWDzgkvrDDGiQl5OPVGRNwch9jnGZvzZfELkMVKbw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Efficient exhaustive search for binary complementary code sets</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Coxson, Gregory E. ; Russo, Jon C.</creator><creatorcontrib>Coxson, Gregory E. ; Russo, Jon C.</creatorcontrib><description>Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined.</description><identifier>ISBN: 9781467352376</identifier><identifier>ISBN: 1467352373</identifier><identifier>EISBN: 146735239X</identifier><identifier>EISBN: 9781467352390</identifier><identifier>EISBN: 1467352381</identifier><identifier>EISBN: 9781467352383</identifier><identifier>DOI: 10.1109/CISS.2013.6552317</identifier><language>eng</language><publisher>IEEE</publisher><subject>autocorrelation sidelobes ; binary code ; Binary codes ; complementary code set ; Correlation ; Error correction ; Error correction codes ; exhaustive search ; Hadamard matrix ; Laboratories ; Radar imaging ; Vectors</subject><ispartof>2013 47th Annual Conference on Information Sciences and Systems (CISS), 2013, p.1-6</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6552317$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6552317$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Coxson, Gregory E.</creatorcontrib><creatorcontrib>Russo, Jon C.</creatorcontrib><title>Efficient exhaustive search for binary complementary code sets</title><title>2013 47th Annual Conference on Information Sciences and Systems (CISS)</title><addtitle>CISS</addtitle><description>Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined.</description><subject>autocorrelation sidelobes</subject><subject>binary code</subject><subject>Binary codes</subject><subject>complementary code set</subject><subject>Correlation</subject><subject>Error correction</subject><subject>Error correction codes</subject><subject>exhaustive search</subject><subject>Hadamard matrix</subject><subject>Laboratories</subject><subject>Radar imaging</subject><subject>Vectors</subject><isbn>9781467352376</isbn><isbn>1467352373</isbn><isbn>146735239X</isbn><isbn>9781467352390</isbn><isbn>1467352381</isbn><isbn>9781467352383</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j89KAzEYxCMiqHUfQLzsC-yaf_sluQiy1FooeGgL3kqS_UIj3bZsVtG3N9J6Gn4wM8wQcs9ozRg1j-18uaw5ZaKGpuGCqQtyyyQokcG8X5LCKP3PCq5JkdIHpTRngRtxQ56mIUQfcT-W-L21n2mMX1gmtIPfluEwlC7u7fBT-kN_3GGffSfq_kxjuiNXwe4SFmedkPXLdNW-Vou32bx9XlSRMz1WwXHQWoN1wXIpJLNoZB4N4DrtrKes0UgRuHOgtG465aWDzgkvrDDGiQl5OPVGRNwch9jnGZvzZfELkMVKbw</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Coxson, Gregory E.</creator><creator>Russo, Jon C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20130101</creationdate><title>Efficient exhaustive search for binary complementary code sets</title><author>Coxson, Gregory E. ; Russo, Jon C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-fb268886abfa24341ae9401366bd8bac0158e0e62bb67885d7c4b6db3c3a399b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>autocorrelation sidelobes</topic><topic>binary code</topic><topic>Binary codes</topic><topic>complementary code set</topic><topic>Correlation</topic><topic>Error correction</topic><topic>Error correction codes</topic><topic>exhaustive search</topic><topic>Hadamard matrix</topic><topic>Laboratories</topic><topic>Radar imaging</topic><topic>Vectors</topic><toplevel>online_resources</toplevel><creatorcontrib>Coxson, Gregory E.</creatorcontrib><creatorcontrib>Russo, Jon C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Coxson, Gregory E.</au><au>Russo, Jon C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Efficient exhaustive search for binary complementary code sets</atitle><btitle>2013 47th Annual Conference on Information Sciences and Systems (CISS)</btitle><stitle>CISS</stitle><date>2013-01-01</date><risdate>2013</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><isbn>9781467352376</isbn><isbn>1467352373</isbn><eisbn>146735239X</eisbn><eisbn>9781467352390</eisbn><eisbn>1467352381</eisbn><eisbn>9781467352383</eisbn><abstract>Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined.</abstract><pub>IEEE</pub><doi>10.1109/CISS.2013.6552317</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781467352376 |
| ispartof | 2013 47th Annual Conference on Information Sciences and Systems (CISS), 2013, p.1-6 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6552317 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | autocorrelation sidelobes binary code Binary codes complementary code set Correlation Error correction Error correction codes exhaustive search Hadamard matrix Laboratories Radar imaging Vectors |
| title | Efficient exhaustive search for binary complementary code sets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T19%3A19%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Efficient%20exhaustive%20search%20for%20binary%20complementary%20code%20sets&rft.btitle=2013%2047th%20Annual%20Conference%20on%20Information%20Sciences%20and%20Systems%20(CISS)&rft.au=Coxson,%20Gregory%20E.&rft.date=2013-01-01&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.isbn=9781467352376&rft.isbn_list=1467352373&rft_id=info:doi/10.1109/CISS.2013.6552317&rft_dat=%3Cieee_6IE%3E6552317%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=146735239X&rft.eisbn_list=9781467352390&rft.eisbn_list=1467352381&rft.eisbn_list=9781467352383&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6552317&rfr_iscdi=true |