New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm

New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ra...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 37; číslo 3; s. 721 - 729
Hlavní autori: Bender, P.E., Wolf, J.K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.05.1991
Institute of Electrical and Electronics Engineers
Predmet:
ISSN:0018-9448, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ratio that the improved algorithm achieves. For completeness, they describe the Lempel-Ziv-Welch data compression algorithm presented by T. A. Welch (1984). A software implementation for both the original and the improved Lempel-Ziv algorithms is given, and the algorithms are compared with each other as well as with the Lempel-Ziv-Welch algorithm.< >
AbstractList New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ratio that the improved algorithm achieves. For completeness, they describe the Lempel-Ziv-Welch data compression algorithm presented by T. A. Welch (1984). A software implementation for both the original and the improved Lempel-Ziv algorithms is given, and the algorithms are compared with each other as well as with the Lempel-Ziv-Welch algorithm.< >
New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ratio that the improved algorithm achieves. For completeness, they describe the Lempel-Ziv-Welch data compression algorithm presented by T. A. Welch (1984). A software implementation for both the original and the improved Lempel-Ziv algorithms is given, and the algorithms are compared with each other as well as with the Lempel-Ziv-Welch algorithm
Author Bender, P.E.
Wolf, J.K.
Author_xml – sequence: 1
  givenname: P.E.
  surname: Bender
  fullname: Bender, P.E.
  organization: Center for Magnetic Recording Res., California Univ., La Jolla, CA, USA
– sequence: 2
  givenname: J.K.
  surname: Wolf
  fullname: Wolf, J.K.
  organization: Center for Magnetic Recording Res., California Univ., La Jolla, CA, USA
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5005741$$DView record in Pascal Francis
BookMark eNptkL1LBDEQxYMoeH6ArV0KEZs9k0tySUoRv-DQQm1swlwyq5HdzbnJKf73rp5aiNUwvN97zLwtst6lDgnZ42zMObPH3Iy1tXKyRkZcKV3ZqZLrZMQYN5WV0mySrZyfh1UqPhmR22t8o5Df20VJJXo6T8suZApdoLFd9OkVW-xKpqmj5QnpDNsFNtVDfKUBClCfBghzjoMOzWPqY3lqd8hGDU3G3e-5Te7Pz-5OL6vZzcXV6cms8mJqSxWCNN5w5YVCZiBIPtdGaxGmwgRhFdSeSyaC5pZ7VksPQQcGhjGcGz3hYpscrnKHO1-WmItrY_bYNNBhWmY3MdIKIaYDePANQvbQ1D10Pma36GML_btTjCktP_PGK8z3Kecea-djgTL8VnqIjePMfVbsuHFfFQ-Goz-Gn8h_0P0VGhHxF1tpHyD0hVg
CODEN IETTAW
CitedBy_id crossref_primary_10_1364_AO_32_000752
crossref_primary_10_1109_18_382018
crossref_primary_10_1002__SICI_1520_6432_199903_82_3_1__AID_ECJB1_3_0_CO_2_W
crossref_primary_10_12677_SEA_2014_33007
crossref_primary_10_1002_ecjc_4430790810
crossref_primary_10_1016_S0020_0255_01_00103_7
crossref_primary_10_1002_ecjc_4430760809
crossref_primary_10_1080_03610918_2024_2404520
crossref_primary_10_1109_TIT_2013_2259291
crossref_primary_10_1007_s11276_016_1289_9
crossref_primary_10_1109_18_259648
crossref_primary_10_1016_j_dsp_2017_06_028
crossref_primary_10_1109_18_532879
crossref_primary_10_1109_TIT_2006_885458
crossref_primary_10_1137_S0097539797331105
crossref_primary_10_1016_j_jag_2012_02_005
Cites_doi 10.1145/322234.322237
10.1109/TIT.1978.1055959
10.1109/TIT.1977.1055714
10.1109/18.45281
10.1109/JRPROC.1952.273898
10.1109/TIT.1981.1056282
10.1109/MC.1984.1659158
10.1147/rd.232.0149
10.1109/TIT.1978.1055934
ContentType Journal Article
Copyright 1992 INIST-CNRS
Copyright_xml – notice: 1992 INIST-CNRS
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/18.79942
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Applied Sciences
EISSN 1557-9654
EndPage 729
ExternalDocumentID 5005741
10_1109_18_79942
79942
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACGOD
ACIWK
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
VH1
VJK
AAYXX
CITATION
IQODW
RIG
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c369t-dd48c815c35e08ad41b78773d638d395afc1403d7191c0f4cad7d0a800eb87213
IEDL.DBID RIE
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_18_79942&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9448
IngestDate Sun Sep 28 08:49:24 EDT 2025
Mon Jul 21 09:16:53 EDT 2025
Sat Nov 29 02:54:36 EST 2025
Tue Nov 18 21:31:44 EST 2025
Wed Aug 27 02:13:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Compression ratio
Storage capacity
Coding
Asymptotic behavior
Limit
Algorithm
Information compression
Comparative study
Implementation
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c369t-dd48c815c35e08ad41b78773d638d395afc1403d7191c0f4cad7d0a800eb87213
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 28493336
PQPubID 23500
PageCount 9
ParticipantIDs pascalfrancis_primary_5005741
crossref_citationtrail_10_1109_18_79942
proquest_miscellaneous_28493336
crossref_primary_10_1109_18_79942
ieee_primary_79942
PublicationCentury 1900
PublicationDate 1991-05-01
PublicationDateYYYYMMDD 1991-05-01
PublicationDate_xml – month: 05
  year: 1991
  text: 1991-05-01
  day: 01
PublicationDecade 1990
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 1991
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
References ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref2
(ref11) 1987
ref1
(ref10) 0
References_xml – ident: ref7
  doi: 10.1145/322234.322237
– ident: ref4
  doi: 10.1109/TIT.1978.1055959
– ident: ref1
  doi: 10.1109/TIT.1977.1055714
– ident: ref9
  doi: 10.1109/18.45281
– ident: ref3
  doi: 10.1109/JRPROC.1952.273898
– year: 0
  ident: ref10
– ident: ref6
  doi: 10.1109/TIT.1981.1056282
– ident: ref2
  doi: 10.1109/MC.1984.1659158
– year: 1987
  ident: ref11
  publication-title: "COMPRESS(l) " Programmer's Ref Man
– ident: ref5
  doi: 10.1147/rd.232.0149
– ident: ref8
  doi: 10.1109/TIT.1978.1055934
SSID ssj0014512
Score 1.4770997
Snippet New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 721
SubjectTerms Applied sciences
Artificial intelligence
Coding, codes
Data compression
Encoding
Entropy
Exact sciences and technology
Information, signal and communications theory
Lifting equipment
Magnetic recording
Signal and communications theory
Software algorithms
Telecommunications and information theory
Title New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm
URI https://ieeexplore.ieee.org/document/79942
https://www.proquest.com/docview/28493336
Volume 37
WOSCitedRecordID wos10_1109_18_79942&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
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9654
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014512
  issn: 0018-9448
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA46POjBuak4dRpB8NStWdOmOYo4PIwh-IPhpaRJqoOtHWs38L_3Je2Gw128lLZJSnnJS95Lvvc-hG7j2PCIiMSRCrSJJmDDcQoXAs9Ew4hybSzM-4ANh-FoxJ-rNDk2FkZrbcFnumNu7Vm-yuTCbJV1GecUpttdxoIyUmt9XkB9UuYFJ6C-4HFUaWaJy7sk7Nh2GwuPZVIxOEiRgyiSksPiz3Rs15h-_T9_d4QOK0sS35dd30A7Om2i-oqlAVdK20QHv1IOHqMXmNWwyL-nsyKDhjg2tEo5FqnCY7u_YLcLc5ylGExDPNBgVk-cj_ESGywpNgj0EjmbYjH5zObj4mt6gt76j68PT05FrOBIL-CFoxQNZUh86fnaDYWiJAa9ZZ4CZVQe90UiTRo_xcCZk25CpVBMuQJsSx2H4DJ6p6iWZqk-Q5gmvV4iGFVa-mDbBdwwWBOWcOn7gQhZC92tpB7JKuu4Ib-YRNb7cHlEwshKroVu1jVnZaaNLXUaRu7r8uple6Mb16W-ibSlpIWuV90age6YAxGR6myRR7A0c8_zgvNtn71A-yUszIAbL1GtmC90G-3JZTHO51d2-P0Aq8zaGA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED9EBfXBj6k4PyMIPlWbNVmbRxHHxDkEp4gvJU1SHcxW1k7wv_eSdkPRF19K2ySlXHLJXfK7-wGcJInlEZGppzRqE0vRhhMMLxSfqcER5btYmMde2O9HT0_irk6T42JhjDEOfGbO7K07y9e5mtitsvNQCIbT7QJnrOVXsVqzEwPGaZUZnKICo89RJ5qlvjin0Zlr-WPpcVwqFgkpCxRGWrFY_JqQ3SrTWfvP_63Dam1Lkouq8zdgzmQNWJvyNJBabRuw8i3p4Cbc47xGZPH59l7m2JAkllipIDLTZOh2GNyGYUHyjKBxSHoGDeuR9zz8IBZNSiwGvcLOZkSOXvLxsHx924KHztXgsuvV1AqeCtqi9LRmkYooVwE3fiQ1owlqbhhoVEcdCC5TZRP56RDdOeWnTEkdal-idWmSCJ3GYBvmszwzO0BY2mqlMmTaKI7WXVtYDmsapkJx3pZR2ITTqdRjVecdt_QXo9j5H76IaRQ7yTXheFbzvcq18UedDSv3WXn98uBHN85KuY21ZbQJR9NujVF77JGIzEw-KWJcnEUQBO3dvz57BEvdwW0v7l33b_ZguQKJWajjPsyX44k5gEX1UQ6L8aEbil8lzd1f
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%3Ajournal&rft.genre=article&rft.atitle=New+asymptotic+bounds+and+improvements+on+the+Lempel-Ziv+data+compression+algorithm&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Bender%2C+P.E.&rft.au=Wolf%2C+J.K.&rft.date=1991-05-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=37&rft.issue=3&rft.spage=721&rft.epage=729&rft_id=info:doi/10.1109%2F18.79942&rft.externalDocID=79942
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon