On the performance of recency-rank and block-sorting universal lossless data compression algorithms

We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information Theory: 2000 IEEE International Symposium On S. 327
1. Verfasser: Muramatsu, J.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2000
Schlagworte:
Data compression
Decoding
Entropy
Laboratories
Performance loss
Sorting
Source coding
ISBN:9780780358577, 0780358570
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.
AbstractList We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.
Author Muramatsu, J.
Author_xml – sequence: 1
  givenname: J.
  surname: Muramatsu
  fullname: Muramatsu, J.
  organization: NTT Commun. Sci. Labs., Kyoto, Japan
BookMark eNotkE9LAzEUxAMqqLV38ZQvsPUl2d0kRyn-KRR6sJ7L2-zbNnY3Kckq9Nu7UGFgGH4wMHPPrkMMxNijgIUQYJ9Xn6vtQgLAwtR1LasrNrfawCRVmUrrWzbP-XviUFZQi_qOuU3g44H4iVIX04DBEY8dT-QouHORMBw5hpY3fXTHIsc0-rDnP8H_UsrY8z7m3FPOvMURuYvDKU3Jx8Cx38fkx8OQH9hNh32m-b_P2Nfb63b5Uaw376vly7rwAsqxMJYsaoNNY0tlpFBSkdYlyFY60UljoYXWgDHClagbnEbppmxtZV1lOkVqxp4uvZ6IdqfkB0zn3eUJ9Qf9c1bj
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ISIT.2000.866625
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 866625
GroupedDBID 6IE
6IH
6IK
6IL
AAJGR
AAVQY
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i104t-89e9a78abb943821323e77402d2c1f2890d0d80881c4a7ba8037b4d959c58f3e3
IEDL.DBID RIE
ISBN 9780780358577
0780358570
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168322900323&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 18:04:31 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-89e9a78abb943821323e77402d2c1f2890d0d80881c4a7ba8037b4d959c58f3e3
ParticipantIDs ieee_primary_866625
PublicationCentury 2000
PublicationDate 20000000
PublicationDateYYYYMMDD 2000-01-01
PublicationDate_xml – year: 2000
  text: 20000000
PublicationDecade 2000
PublicationTitle Information Theory: 2000 IEEE International Symposium On
PublicationTitleAbbrev ISIT
PublicationYear 2000
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000450616
Score 1.2801527
Snippet We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.
SourceID ieee
SourceType Publisher
StartPage 327
SubjectTerms Data compression
Decoding
Entropy
Laboratories
Performance loss
Sorting
Source coding
Title On the performance of recency-rank and block-sorting universal lossless data compression algorithms
URI https://ieeexplore.ieee.org/document/866625
WOSCitedRecordID wos000168322900323&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4I8eDJF0bxkT14XSgt7e6ejUQuSCIm3Mi-isTaEij-fmd2ecTEi7e2h7aZTWa-eXzfEPJolc0glCoWSx2hqLZgClwlM6gHJSJuezz3yyb4aCSmUzne6mx7Loxzzg-fuQ5e-l6-rcwGS2VdAVg7ThukwXkWqFr7cgogE4hMmU_MRZSkqNu-1dfZ3fNdlzKS3eHbcOJZKp3wzl-7VXxoGZz-66fOSOtA0aPjffA5J0euvCTmtaQA6OjywAagVU7BqSHBkuF-dqpKSzVEsE-2rlBBYE43YTZDFbSAiFmA66M4N0px2jxMyZZUFfNqtag_vtYt8j54njy9sO0WBbaAVKtmQjqpuFBaS2z6QfaZOMB8UWxj08uxz2gjK8DZ9Exfca3AWlz3rUylSUWeuOSKNMuqdNeEAjQURiYaYI3tW47bYgAxyEzIFL4h3Q25QPvMlkEoYxZM0_7z6S05Cax2rGbckWa92rh7cmy-68V69eAP9wdBpqGn
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4omujJF8a3e_C6UFrK7p6NBCIiiZhwI9vdLRJrS2jx9zuzLRATL97aHtpmNpn55vF9Q8iDUaYDoVQxX0YeimoLpsBVMo16UMLjpsVjt2yCD4diMpGjSmfbcWGstW74zDbw0vXyTaZXWCprCsDafrhL9nBxVkXW2hRUAJtAbOq41Fx4QYjK7ZXCzvqer_uUnmz23_pjx1NplG_9tV3FBZfu0b9-65jUtyQ9OtqEnxOyY9Mzol9TCpCOLrZ8AJrFFNwaUiwZbminKjU0ghj2yfIMNQRmdFVOZ6iEJhAzE3B-FCdHKc6bl3OyKVXJLFvOi4-vvE7eu0_jxx6r9iiwOSRbBRPSSsWFiiKJbT_IPwMLqM_zja9bMXYajWcEuJuWbiseKbAWj9pGhlKHIg5scE5qaZbaC0IBHAotgwiAjWkbjvtiADPIjpAhfEPaS3KK9pkuSqmMaWmaqz-f3pOD3vhlMB30h8_X5LDkuGNt44bUiuXK3pJ9_V3M8-WdO-gf4CKk8A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Information+Theory%3A+2000+IEEE+International+Symposium+On&rft.atitle=On+the+performance+of+recency-rank+and+block-sorting+universal+lossless+data+compression+algorithms&rft.au=Muramatsu%2C+J.&rft.date=2000-01-01&rft.pub=IEEE&rft.isbn=9780780358577&rft.spage=327&rft_id=info:doi/10.1109%2FISIT.2000.866625&rft.externalDocID=866625
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/sc.gif&client=summon&freeimage=true