A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings
Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to...
Gespeichert in:
Veröffentlicht in: | Advances in Information Systems 2004-01, p.420-429 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 429 |
---|---|
container_issue | |
container_start_page | 420 |
container_title | Advances in Information Systems |
container_volume | |
creator | Celikel, Ebru Dalkılıç, Mehmet Emin |
description | Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to achieve compression, which can be increased by redistributing the symbol statistics in a recoverable manner. We introduce a symbol redistributing scheme to serve as a preprocessor to improve compression. The preprocessor itself is an encryption machine providing compression and simple security. The preprocessor is succeeded by conventional compression tool to offer further compression. The overall scheme is called the Secure Compressor (SeCom). The system employing Arithmetic or Huffman Coding as compressor has been implemented and tested on sample texts in English and Turkish. Results show that SeCom considerably improves compression performances of both algorithms and introduces security to the system, as well. |
doi_str_mv | 10.1007/978-3-540-30198-1_43 |
format | Article |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16368441</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16368441</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-8d9a37917fe94f4553a18805b05f7c064b07a73bba67c9dafed4c940339b811f3</originalsourceid><addsrcrecordid>eNotkE1PwzAMhsOXxBj7Bxxy4RhI6rRJjtMEbNIkJgHnKG2TrbA2VdIh7d-Tbvhiye9jy3oQemD0iVEqnpWQBEjOKQHKlCRMc7hAd5AmpwG_RBNWMEYAuLpCs8SPWQZcSH6NJonKiBIcbtEsxm86lpKS8Qkq53gTbB98ZWP0Ac_ruum2-MNWh9AMRzx4bLoar9qE_I7JsLN4Y4PzoTVdWsLe4XlCd60dmuoELw_OpRAv_Hgr3qMbZ_bRzv77FH29vnwulmT9_rZazNekzzI5EFkrA0Ix4azijuc5GCYlzUuaO1HRgpdUGAFlaQpRqdo4W_NKJQOgSsmYgyl6PN_tTazM3oX0XxN1H5rWhKNmBRSSc5a47MzFFHVbG3Tp_U_UjOrRtk72NOjkT5_k6tE2_AEFn22d</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings</title><source>Springer Books</source><creator>Celikel, Ebru ; Dalkılıç, Mehmet Emin</creator><contributor>Yakhno, Tatyana</contributor><creatorcontrib>Celikel, Ebru ; Dalkılıç, Mehmet Emin ; Yakhno, Tatyana</creatorcontrib><description>Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to achieve compression, which can be increased by redistributing the symbol statistics in a recoverable manner. We introduce a symbol redistributing scheme to serve as a preprocessor to improve compression. The preprocessor itself is an encryption machine providing compression and simple security. The preprocessor is succeeded by conventional compression tool to offer further compression. The overall scheme is called the Secure Compressor (SeCom). The system employing Arithmetic or Huffman Coding as compressor has been implemented and tested on sample texts in English and Turkish. Results show that SeCom considerably improves compression performances of both algorithms and introduces security to the system, as well.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540234784</identifier><identifier>ISBN: 3540234780</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540301984</identifier><identifier>EISBN: 9783540301981</identifier><identifier>DOI: 10.1007/978-3-540-30198-1_43</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Arithmetic Code ; Compression Performance ; Computer science; control theory; systems ; English Text ; Exact sciences and technology ; Huffman Code ; Information systems. Data bases ; Lossless Compression ; Memory organisation. Data processing ; Software</subject><ispartof>Advances in Information Systems, 2004-01, p.420-429</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30198-1_43$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30198-1_43$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16368441$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yakhno, Tatyana</contributor><creatorcontrib>Celikel, Ebru</creatorcontrib><creatorcontrib>Dalkılıç, Mehmet Emin</creatorcontrib><title>A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings</title><title>Advances in Information Systems</title><description>Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to achieve compression, which can be increased by redistributing the symbol statistics in a recoverable manner. We introduce a symbol redistributing scheme to serve as a preprocessor to improve compression. The preprocessor itself is an encryption machine providing compression and simple security. The preprocessor is succeeded by conventional compression tool to offer further compression. The overall scheme is called the Secure Compressor (SeCom). The system employing Arithmetic or Huffman Coding as compressor has been implemented and tested on sample texts in English and Turkish. Results show that SeCom considerably improves compression performances of both algorithms and introduces security to the system, as well.</description><subject>Applied sciences</subject><subject>Arithmetic Code</subject><subject>Compression Performance</subject><subject>Computer science; control theory; systems</subject><subject>English Text</subject><subject>Exact sciences and technology</subject><subject>Huffman Code</subject><subject>Information systems. Data bases</subject><subject>Lossless Compression</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540234784</isbn><isbn>3540234780</isbn><isbn>3540301984</isbn><isbn>9783540301981</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNotkE1PwzAMhsOXxBj7Bxxy4RhI6rRJjtMEbNIkJgHnKG2TrbA2VdIh7d-Tbvhiye9jy3oQemD0iVEqnpWQBEjOKQHKlCRMc7hAd5AmpwG_RBNWMEYAuLpCs8SPWQZcSH6NJonKiBIcbtEsxm86lpKS8Qkq53gTbB98ZWP0Ac_ruum2-MNWh9AMRzx4bLoar9qE_I7JsLN4Y4PzoTVdWsLe4XlCd60dmuoELw_OpRAv_Hgr3qMbZ_bRzv77FH29vnwulmT9_rZazNekzzI5EFkrA0Ix4azijuc5GCYlzUuaO1HRgpdUGAFlaQpRqdo4W_NKJQOgSsmYgyl6PN_tTazM3oX0XxN1H5rWhKNmBRSSc5a47MzFFHVbG3Tp_U_UjOrRtk72NOjkT5_k6tE2_AEFn22d</recordid><startdate>20040101</startdate><enddate>20040101</enddate><creator>Celikel, Ebru</creator><creator>Dalkılıç, Mehmet Emin</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>20040101</creationdate><title>A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings</title><author>Celikel, Ebru ; Dalkılıç, Mehmet Emin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-8d9a37917fe94f4553a18805b05f7c064b07a73bba67c9dafed4c940339b811f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Arithmetic Code</topic><topic>Compression Performance</topic><topic>Computer science; control theory; systems</topic><topic>English Text</topic><topic>Exact sciences and technology</topic><topic>Huffman Code</topic><topic>Information systems. Data bases</topic><topic>Lossless Compression</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Celikel, Ebru</creatorcontrib><creatorcontrib>Dalkılıç, Mehmet Emin</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Advances in Information Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Celikel, Ebru</au><au>Dalkılıç, Mehmet Emin</au><au>Yakhno, Tatyana</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings</atitle><jtitle>Advances in Information Systems</jtitle><date>2004-01-01</date><risdate>2004</risdate><spage>420</spage><epage>429</epage><pages>420-429</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540234784</isbn><isbn>3540234780</isbn><eisbn>3540301984</eisbn><eisbn>9783540301981</eisbn><abstract>Arithmetic Coding and Huffman Coding are among the most common lossless compression algorithms. Their compression performances are relatively low as compared to some other tools. Still, they have widespread acceptance due to their high throughput rates. Both algorithms exploit symbol frequencies to achieve compression, which can be increased by redistributing the symbol statistics in a recoverable manner. We introduce a symbol redistributing scheme to serve as a preprocessor to improve compression. The preprocessor itself is an encryption machine providing compression and simple security. The preprocessor is succeeded by conventional compression tool to offer further compression. The overall scheme is called the Secure Compressor (SeCom). The system employing Arithmetic or Huffman Coding as compressor has been implemented and tested on sample texts in English and Turkish. Results show that SeCom considerably improves compression performances of both algorithms and introduces security to the system, as well.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30198-1_43</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Advances in Information Systems, 2004-01, p.420-429 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_16368441 |
source | Springer Books |
subjects | Applied sciences Arithmetic Code Compression Performance Computer science control theory systems English Text Exact sciences and technology Huffman Code Information systems. Data bases Lossless Compression Memory organisation. Data processing Software |
title | A Preprocessor Adding Security to and Improving the Performances of Arithmetic and Huffman Codings |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T16%3A46%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Preprocessor%20Adding%20Security%20to%20and%20Improving%20the%20Performances%20of%20Arithmetic%20and%20Huffman%20Codings&rft.jtitle=Advances%20in%20Information%20Systems&rft.au=Celikel,%20Ebru&rft.date=2004-01-01&rft.spage=420&rft.epage=429&rft.pages=420-429&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540234784&rft.isbn_list=3540234780&rft_id=info:doi/10.1007/978-3-540-30198-1_43&rft_dat=%3Cpascalfrancis_sprin%3E16368441%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540301984&rft.eisbn_list=9783540301981&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |