Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels
For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.
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 | 4 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | 2 |
| creator | Munteanu, V. Tarniceriu, D. |
| description | For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length. |
| doi_str_mv | 10.1109/ISSCS.2007.4292770 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4292770</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4292770</ieee_id><sourcerecordid>4292770</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-890af03898997c3c14f03a015453850575304080f96370b50a0d06600d7cfb0c3</originalsourceid><addsrcrecordid>eNpFT11LwzAAjIigzv0BfckfaL00SZM8uuLHoLiH6vPImsRVajOaivjvLTrwXo67g-OOkGuGnDGY23XTVE1eACoXhSmUwgm5ZKIQAqY07PRfaH5Olim9YwY3pVTFBVmt4ufgEo0DraLzX3F0tPbD27SfvUA3h6n7sP1vlmiII32OXfK9T4lWezsMvk9X5CzYPvnlkRfk9eH-pXrK6s3jurqrs44pOWXawAZwbbQxquUtE7OyYFJIriWkkhwCGsGUXGEnYeFQloBTbdih5Qty89fbee-3h3EeNn5vj5_5D0IeSHo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Munteanu, V. ; Tarniceriu, D.</creator><creatorcontrib>Munteanu, V. ; Tarniceriu, D.</creatorcontrib><description>For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.</description><identifier>ISBN: 1424409683</identifier><identifier>ISBN: 9781424409686</identifier><identifier>EISBN: 1424409691</identifier><identifier>EISBN: 9781424409693</identifier><identifier>DOI: 10.1109/ISSCS.2007.4292770</identifier><language>eng</language><publisher>IEEE</publisher><subject>average codeword length ; Distributed computing ; Electronic mail ; Encoding ; Entropy ; Huffman coding ; Lagrangian functions ; Length measurement ; Probability distribution ; Time measurement ; Upper bound</subject><ispartof>2007 International Symposium on Signals, Circuits and Systems, 2007, Vol.2, p.1-4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4292770$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4292770$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Munteanu, V.</creatorcontrib><creatorcontrib>Tarniceriu, D.</creatorcontrib><title>Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels</title><title>2007 International Symposium on Signals, Circuits and Systems</title><addtitle>ISSCS</addtitle><description>For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.</description><subject>average codeword length</subject><subject>Distributed computing</subject><subject>Electronic mail</subject><subject>Encoding</subject><subject>Entropy</subject><subject>Huffman coding</subject><subject>Lagrangian functions</subject><subject>Length measurement</subject><subject>Probability distribution</subject><subject>Time measurement</subject><subject>Upper bound</subject><isbn>1424409683</isbn><isbn>9781424409686</isbn><isbn>1424409691</isbn><isbn>9781424409693</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFT11LwzAAjIigzv0BfckfaL00SZM8uuLHoLiH6vPImsRVajOaivjvLTrwXo67g-OOkGuGnDGY23XTVE1eACoXhSmUwgm5ZKIQAqY07PRfaH5Olim9YwY3pVTFBVmt4ufgEo0DraLzX3F0tPbD27SfvUA3h6n7sP1vlmiII32OXfK9T4lWezsMvk9X5CzYPvnlkRfk9eH-pXrK6s3jurqrs44pOWXawAZwbbQxquUtE7OyYFJIriWkkhwCGsGUXGEnYeFQloBTbdih5Qty89fbee-3h3EeNn5vj5_5D0IeSHo</recordid><startdate>200707</startdate><enddate>200707</enddate><creator>Munteanu, V.</creator><creator>Tarniceriu, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200707</creationdate><title>Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels</title><author>Munteanu, V. ; Tarniceriu, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-890af03898997c3c14f03a015453850575304080f96370b50a0d06600d7cfb0c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>average codeword length</topic><topic>Distributed computing</topic><topic>Electronic mail</topic><topic>Encoding</topic><topic>Entropy</topic><topic>Huffman coding</topic><topic>Lagrangian functions</topic><topic>Length measurement</topic><topic>Probability distribution</topic><topic>Time measurement</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Munteanu, V.</creatorcontrib><creatorcontrib>Tarniceriu, D.</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>Munteanu, V.</au><au>Tarniceriu, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels</atitle><btitle>2007 International Symposium on Signals, Circuits and Systems</btitle><stitle>ISSCS</stitle><date>2007-07</date><risdate>2007</risdate><volume>2</volume><spage>1</spage><epage>4</epage><pages>1-4</pages><isbn>1424409683</isbn><isbn>9781424409686</isbn><eisbn>1424409691</eisbn><eisbn>9781424409693</eisbn><abstract>For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.</abstract><pub>IEEE</pub><doi>10.1109/ISSCS.2007.4292770</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424409683 |
| ispartof | 2007 International Symposium on Signals, Circuits and Systems, 2007, Vol.2, p.1-4 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_4292770 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | average codeword length Distributed computing Electronic mail Encoding Entropy Huffman coding Lagrangian functions Length measurement Probability distribution Time measurement Upper bound |
| title | Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T18%3A07%3A56IST&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=Bounds%20on%20Codeword%20Lengths%20of%20Optimal%20Codes%20for%20Noiseless%20Channels&rft.btitle=2007%20International%20Symposium%20on%20Signals,%20Circuits%20and%20Systems&rft.au=Munteanu,%20V.&rft.date=2007-07&rft.volume=2&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.isbn=1424409683&rft.isbn_list=9781424409686&rft_id=info:doi/10.1109/ISSCS.2007.4292770&rft_dat=%3Cieee_6IE%3E4292770%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424409691&rft.eisbn_list=9781424409693&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4292770&rfr_iscdi=true |