Almost all complete binary prefix codes have a self-synchronizing string
The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity.
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2003-09, Vol.49 (9), p.2219-2225 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2225 |
|---|---|
| container_issue | 9 |
| container_start_page | 2219 |
| container_title | IEEE transactions on information theory |
| container_volume | 49 |
| creator | Freiling, C.F. Jungreis, D.S. Theberge, F. Zeger, K. |
| description | The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity. |
| doi_str_mv | 10.1109/TIT.2003.815803 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28366647</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1226607</ieee_id><sourcerecordid>452367001</sourcerecordid><originalsourceid>FETCH-LOGICAL-c444t-580078a4d4f63d1ae6d0858d0b147a55261c2bf0ff8910d0054bbff27c49cb343</originalsourceid><addsrcrecordid>eNp9kc1LAzEQxYMoWKtnD16CBz1tO8km2eRYih-Fgpd6DtndxG7JfrjZivWvN2UFwYOnxwy_eczMQ-iawIwQUPPNajOjAOlMEi4hPUETwnmWKMHZKZoAEJkoxuQ5ughhF0vGCZ2g54Wv2zBg4z0u2rrzdrA4rxrTH3DXW1d9xnZpA96aD4sNDta7JByaYtu3TfVVNW84DH2US3TmjA_26ken6PXxYbN8TtYvT6vlYp0UjLEhiatBJg0rmRNpSYwVJUguS8gJywznVJCC5g6ck4pACcBZnjtHs4KpIk9ZOkX3o2_Xt-97GwZdV6Gw3pvGtvugFRCRKSGO5N2_JJWpiFwWwds_4K7d9028QhPFpaTRLELzESr6NoT4Gd31VR3fpAnoYwA6BqCPAegxgDhxM05U1tpfmlIhIEu_Ad4GgFo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195882643</pqid></control><display><type>article</type><title>Almost all complete binary prefix codes have a self-synchronizing string</title><source>IEEE Electronic Library (IEL)</source><creator>Freiling, C.F. ; Jungreis, D.S. ; Theberge, F. ; Zeger, K.</creator><creatorcontrib>Freiling, C.F. ; Jungreis, D.S. ; Theberge, F. ; Zeger, K.</creatorcontrib><description>The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2003.815803</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Binary codes ; Binary system ; Codes ; Communications networks ; Decoding ; Delay ; Electrical engineering ; Error correction codes ; H infinity control ; Infinity ; Information theory ; Probability ; Random variables ; Source coding ; Statistics ; Strings</subject><ispartof>IEEE transactions on information theory, 2003-09, Vol.49 (9), p.2219-2225</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c444t-580078a4d4f63d1ae6d0858d0b147a55261c2bf0ff8910d0054bbff27c49cb343</citedby><cites>FETCH-LOGICAL-c444t-580078a4d4f63d1ae6d0858d0b147a55261c2bf0ff8910d0054bbff27c49cb343</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1226607$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1226607$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Freiling, C.F.</creatorcontrib><creatorcontrib>Jungreis, D.S.</creatorcontrib><creatorcontrib>Theberge, F.</creatorcontrib><creatorcontrib>Zeger, K.</creatorcontrib><title>Almost all complete binary prefix codes have a self-synchronizing string</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity.</description><subject>Binary codes</subject><subject>Binary system</subject><subject>Codes</subject><subject>Communications networks</subject><subject>Decoding</subject><subject>Delay</subject><subject>Electrical engineering</subject><subject>Error correction codes</subject><subject>H infinity control</subject><subject>Infinity</subject><subject>Information theory</subject><subject>Probability</subject><subject>Random variables</subject><subject>Source coding</subject><subject>Statistics</subject><subject>Strings</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kc1LAzEQxYMoWKtnD16CBz1tO8km2eRYih-Fgpd6DtndxG7JfrjZivWvN2UFwYOnxwy_eczMQ-iawIwQUPPNajOjAOlMEi4hPUETwnmWKMHZKZoAEJkoxuQ5ughhF0vGCZ2g54Wv2zBg4z0u2rrzdrA4rxrTH3DXW1d9xnZpA96aD4sNDta7JByaYtu3TfVVNW84DH2US3TmjA_26ken6PXxYbN8TtYvT6vlYp0UjLEhiatBJg0rmRNpSYwVJUguS8gJywznVJCC5g6ck4pACcBZnjtHs4KpIk9ZOkX3o2_Xt-97GwZdV6Gw3pvGtvugFRCRKSGO5N2_JJWpiFwWwds_4K7d9028QhPFpaTRLELzESr6NoT4Gd31VR3fpAnoYwA6BqCPAegxgDhxM05U1tpfmlIhIEu_Ad4GgFo</recordid><startdate>20030901</startdate><enddate>20030901</enddate><creator>Freiling, C.F.</creator><creator>Jungreis, D.S.</creator><creator>Theberge, F.</creator><creator>Zeger, K.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030901</creationdate><title>Almost all complete binary prefix codes have a self-synchronizing string</title><author>Freiling, C.F. ; Jungreis, D.S. ; Theberge, F. ; Zeger, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c444t-580078a4d4f63d1ae6d0858d0b147a55261c2bf0ff8910d0054bbff27c49cb343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Binary codes</topic><topic>Binary system</topic><topic>Codes</topic><topic>Communications networks</topic><topic>Decoding</topic><topic>Delay</topic><topic>Electrical engineering</topic><topic>Error correction codes</topic><topic>H infinity control</topic><topic>Infinity</topic><topic>Information theory</topic><topic>Probability</topic><topic>Random variables</topic><topic>Source coding</topic><topic>Statistics</topic><topic>Strings</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Freiling, C.F.</creatorcontrib><creatorcontrib>Jungreis, D.S.</creatorcontrib><creatorcontrib>Theberge, F.</creatorcontrib><creatorcontrib>Zeger, K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Freiling, C.F.</au><au>Jungreis, D.S.</au><au>Theberge, F.</au><au>Zeger, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Almost all complete binary prefix codes have a self-synchronizing string</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2003-09-01</date><risdate>2003</risdate><volume>49</volume><issue>9</issue><spage>2219</spage><epage>2225</epage><pages>2219-2225</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>The probability that a complete binary prefix code has a self-synchronizing string approaches one, as the number of codewords tends to infinity.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2003.815803</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2003-09, Vol.49 (9), p.2219-2225 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28366647 |
| source | IEEE Electronic Library (IEL) |
| subjects | Binary codes Binary system Codes Communications networks Decoding Delay Electrical engineering Error correction codes H infinity control Infinity Information theory Probability Random variables Source coding Statistics Strings |
| title | Almost all complete binary prefix codes have a self-synchronizing string |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T02%3A23%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Almost%20all%20complete%20binary%20prefix%20codes%20have%20a%20self-synchronizing%20string&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Freiling,%20C.F.&rft.date=2003-09-01&rft.volume=49&rft.issue=9&rft.spage=2219&rft.epage=2225&rft.pages=2219-2225&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2003.815803&rft_dat=%3Cproquest_RIE%3E452367001%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195882643&rft_id=info:pmid/&rft_ieee_id=1226607&rfr_iscdi=true |