O(log log n)‐competitive Binary Search Tree

Wang, Chengwen Chris; Sleator, Daniel D.

doi:10.1007/978-0-387-30162-4_263

Search citation statements

Order By: Relevance

Paper Sections

Select...

Basic Principle Huffman Coding Is a Statistical Compression ...1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As shown in Figure 3. Finally, the sequence of '0' or '1' on the branch from the root of the Huffman tree to each leaf node is recorded, so as to obtain the Huffman code of each symbol [16]. As shown in Table 1.…”

Section: Basic Principle Huffman Coding Is a Statistical Compression ...mentioning

confidence: 99%

Common lossless compression algorithms and their error resiliency performance

Zhang

2023

ACE

View full text Add to dashboard Cite

With the development of communication technology and computer technology, many related industries, such as multimedia entertainment, put forward higher requirements for storing and transmitting information data. The research of data compression technology has attracted more and more attention. Therefore, the error resiliency ability of data compression algorithm is particularly important. How to enhance the error resiliency of data compression communication systems has been a hot topic for researchers. This paper mainly introduces the lossless data compression technology and its basic principle and performance index. Two typical lossless compression codes, Huffman and Arithmetic coding are deeply studied, including the principle of coding and the problem of error resiliency. Huffman coding and Arithmetic coding are two very important lossless compression codes widely used. The ability to resist channel error is an important index for data compression in communication. It is of great significance to further improve the channel adaptability of data compression to study the above two kinds of codes and their ability to resist channel error.

show abstract

Section: Basic Principle Huffman Coding Is a Statistical Compression ...mentioning

confidence: 99%