Forward Looking Huffman Coding
Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by st...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Klein, Shmuel T. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2020 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Theory of computing systems - Springer US, 1997, 65(2020), 3 vom: 25. Juni, Seite 593-612 |
|---|---|
| Übergeordnetes Werk: |
volume:65 ; year:2020 ; number:3 ; day:25 ; month:06 ; pages:593-612 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00224-020-09992-7 |
|---|
| Katalog-ID: |
OLC2125619008 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2125619008 | ||
| 003 | DE-627 | ||
| 005 | 20230505104001.0 | ||
| 007 | tu | ||
| 008 | 230505s2020 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00224-020-09992-7 |2 doi | |
| 035 | |a (DE-627)OLC2125619008 | ||
| 035 | |a (DE-He213)s00224-020-09992-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |a 000 |q VZ |
| 100 | 1 | |a Klein, Shmuel T. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Forward Looking Huffman Coding |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2020 | ||
| 520 | |a Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. | ||
| 650 | 4 | |a Lossless data compression | |
| 650 | 4 | |a Huffman coding | |
| 650 | 4 | |a Dynamic Huffman coding | |
| 700 | 1 | |a Saadia, Shoham |4 aut | |
| 700 | 1 | |a Shapira, Dana |0 (orcid)0000-0002-2320-9064 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Theory of computing systems |d Springer US, 1997 |g 65(2020), 3 vom: 25. Juni, Seite 593-612 |w (DE-627)222610387 |w (DE-600)1355722-1 |w (DE-576)056755198 |x 1432-4350 |7 nnns |
| 773 | 1 | 8 | |g volume:65 |g year:2020 |g number:3 |g day:25 |g month:06 |g pages:593-612 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00224-020-09992-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4318 | ||
| 951 | |a AR | ||
| 952 | |d 65 |j 2020 |e 3 |b 25 |c 06 |h 593-612 | ||
| author_variant |
s t k st stk s s ss d s ds |
|---|---|
| matchkey_str |
article:14324350:2020----::owrloiguf |
| hierarchy_sort_str |
2020 |
| publishDate |
2020 |
| allfields |
10.1007/s00224-020-09992-7 doi (DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Klein, Shmuel T. verfasserin aut Forward Looking Huffman Coding 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. Lossless data compression Huffman coding Dynamic Huffman coding Saadia, Shoham aut Shapira, Dana (orcid)0000-0002-2320-9064 aut Enthalten in Theory of computing systems Springer US, 1997 65(2020), 3 vom: 25. Juni, Seite 593-612 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:65 year:2020 number:3 day:25 month:06 pages:593-612 https://doi.org/10.1007/s00224-020-09992-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 AR 65 2020 3 25 06 593-612 |
| spelling |
10.1007/s00224-020-09992-7 doi (DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Klein, Shmuel T. verfasserin aut Forward Looking Huffman Coding 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. Lossless data compression Huffman coding Dynamic Huffman coding Saadia, Shoham aut Shapira, Dana (orcid)0000-0002-2320-9064 aut Enthalten in Theory of computing systems Springer US, 1997 65(2020), 3 vom: 25. Juni, Seite 593-612 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:65 year:2020 number:3 day:25 month:06 pages:593-612 https://doi.org/10.1007/s00224-020-09992-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 AR 65 2020 3 25 06 593-612 |
| allfields_unstemmed |
10.1007/s00224-020-09992-7 doi (DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Klein, Shmuel T. verfasserin aut Forward Looking Huffman Coding 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. Lossless data compression Huffman coding Dynamic Huffman coding Saadia, Shoham aut Shapira, Dana (orcid)0000-0002-2320-9064 aut Enthalten in Theory of computing systems Springer US, 1997 65(2020), 3 vom: 25. Juni, Seite 593-612 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:65 year:2020 number:3 day:25 month:06 pages:593-612 https://doi.org/10.1007/s00224-020-09992-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 AR 65 2020 3 25 06 593-612 |
| allfieldsGer |
10.1007/s00224-020-09992-7 doi (DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Klein, Shmuel T. verfasserin aut Forward Looking Huffman Coding 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. Lossless data compression Huffman coding Dynamic Huffman coding Saadia, Shoham aut Shapira, Dana (orcid)0000-0002-2320-9064 aut Enthalten in Theory of computing systems Springer US, 1997 65(2020), 3 vom: 25. Juni, Seite 593-612 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:65 year:2020 number:3 day:25 month:06 pages:593-612 https://doi.org/10.1007/s00224-020-09992-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 AR 65 2020 3 25 06 593-612 |
| allfieldsSound |
10.1007/s00224-020-09992-7 doi (DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Klein, Shmuel T. verfasserin aut Forward Looking Huffman Coding 2020 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. Lossless data compression Huffman coding Dynamic Huffman coding Saadia, Shoham aut Shapira, Dana (orcid)0000-0002-2320-9064 aut Enthalten in Theory of computing systems Springer US, 1997 65(2020), 3 vom: 25. Juni, Seite 593-612 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:65 year:2020 number:3 day:25 month:06 pages:593-612 https://doi.org/10.1007/s00224-020-09992-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 AR 65 2020 3 25 06 593-612 |
| language |
English |
| source |
Enthalten in Theory of computing systems 65(2020), 3 vom: 25. Juni, Seite 593-612 volume:65 year:2020 number:3 day:25 month:06 pages:593-612 |
| sourceStr |
Enthalten in Theory of computing systems 65(2020), 3 vom: 25. Juni, Seite 593-612 volume:65 year:2020 number:3 day:25 month:06 pages:593-612 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Lossless data compression Huffman coding Dynamic Huffman coding |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Theory of computing systems |
| authorswithroles_txt_mv |
Klein, Shmuel T. @@aut@@ Saadia, Shoham @@aut@@ Shapira, Dana @@aut@@ |
| publishDateDaySort_date |
2020-06-25T00:00:00Z |
| hierarchy_top_id |
222610387 |
| dewey-sort |
14 |
| id |
OLC2125619008 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2125619008</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505104001.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-020-09992-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2125619008</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-020-09992-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Klein, Shmuel T.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Forward Looking Huffman Coding</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lossless data compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Huffman coding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic Huffman coding</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saadia, Shoham</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shapira, Dana</subfield><subfield code="0">(orcid)0000-0002-2320-9064</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">65(2020), 3 vom: 25. Juni, Seite 593-612</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:65</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:25</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:593-612</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-020-09992-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">65</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">25</subfield><subfield code="c">06</subfield><subfield code="h">593-612</subfield></datafield></record></collection>
|
| author |
Klein, Shmuel T. |
| spellingShingle |
Klein, Shmuel T. ddc 004 ddc 510 misc Lossless data compression misc Huffman coding misc Dynamic Huffman coding Forward Looking Huffman Coding |
| authorStr |
Klein, Shmuel T. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)222610387 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics 000 - Computer science, information & general works |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1432-4350 |
| topic_title |
004 510 VZ 510 000 VZ Forward Looking Huffman Coding Lossless data compression Huffman coding Dynamic Huffman coding |
| topic |
ddc 004 ddc 510 misc Lossless data compression misc Huffman coding misc Dynamic Huffman coding |
| topic_unstemmed |
ddc 004 ddc 510 misc Lossless data compression misc Huffman coding misc Dynamic Huffman coding |
| topic_browse |
ddc 004 ddc 510 misc Lossless data compression misc Huffman coding misc Dynamic Huffman coding |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Theory of computing systems |
| hierarchy_parent_id |
222610387 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Theory of computing systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 |
| title |
Forward Looking Huffman Coding |
| ctrlnum |
(DE-627)OLC2125619008 (DE-He213)s00224-020-09992-7-p |
| title_full |
Forward Looking Huffman Coding |
| author_sort |
Klein, Shmuel T. |
| journal |
Theory of computing systems |
| journalStr |
Theory of computing systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
txt |
| container_start_page |
593 |
| author_browse |
Klein, Shmuel T. Saadia, Shoham Shapira, Dana |
| container_volume |
65 |
| class |
004 510 VZ 510 000 VZ |
| format_se |
Aufsätze |
| author-letter |
Klein, Shmuel T. |
| doi_str_mv |
10.1007/s00224-020-09992-7 |
| normlink |
(ORCID)0000-0002-2320-9064 |
| normlink_prefix_str_mv |
(orcid)0000-0002-2320-9064 |
| dewey-full |
004 510 000 |
| title_sort |
forward looking huffman coding |
| title_auth |
Forward Looking Huffman Coding |
| abstract |
Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| abstractGer |
Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| abstract_unstemmed |
Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. © Springer Science+Business Media, LLC, part of Springer Nature 2020 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_30 GBV_ILN_4126 GBV_ILN_4318 |
| container_issue |
3 |
| title_short |
Forward Looking Huffman Coding |
| url |
https://doi.org/10.1007/s00224-020-09992-7 |
| remote_bool |
false |
| author2 |
Saadia, Shoham Shapira, Dana |
| author2Str |
Saadia, Shoham Shapira, Dana |
| ppnlink |
222610387 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00224-020-09992-7 |
| up_date |
2024-07-04T04:18:37.853Z |
| _version_ |
1803620678740475904 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2125619008</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505104001.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2020 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-020-09992-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2125619008</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-020-09992-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Klein, Shmuel T.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Forward Looking Huffman Coding</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2020</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lossless data compression</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Huffman coding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic Huffman coding</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saadia, Shoham</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shapira, Dana</subfield><subfield code="0">(orcid)0000-0002-2320-9064</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">65(2020), 3 vom: 25. Juni, Seite 593-612</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:65</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:25</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:593-612</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-020-09992-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">65</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">25</subfield><subfield code="c">06</subfield><subfield code="h">593-612</subfield></datafield></record></collection>
|
| score |
7.4008236 |