Results 1  10
of
4,288
The Lempel Ziv Algorithm
, 2003
"... The Lempel Ziv Algorithm is an algorithm for lossless data compression. It is not a single algorithm, but a whole family of algorithms, stemming from the two algorithms proposed by Jacob Ziv and Abraham Lempel in their landmark papers in 1977 and 1978. Lempel Ziv algorithms are widely used in com ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Lempel Ziv Algorithm is an algorithm for lossless data compression. It is not a single algorithm, but a whole family of algorithms, stemming from the two algorithms proposed by Jacob Ziv and Abraham Lempel in their landmark papers in 1977 and 1978. Lempel Ziv algorithms are widely used
A Simple Technique for Bounding the Pointwise Redundancy of the 1978 LempelZiv Algorithm
"... If x is a string of finite length over a finite alphabet A, let LZ(x) denote the length of the binary codeword assigned to x by the 1978 version of the LempelZiv data compression algorithm, let t(x) be the number of phrases in the LempelZiv parsing of x, and let µ(x) be the probability assigned to ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
If x is a string of finite length over a finite alphabet A, let LZ(x) denote the length of the binary codeword assigned to x by the 1978 version of the LempelZiv data compression algorithm, let t(x) be the number of phrases in the LempelZiv parsing of x, and let µ(x) be the probability assigned
the Lempel–Ziv Algorithm—Part I: Optimality for Memoryless Sources
"... Abstract — A new lossy variant of the FixedDatabase Lempel–Ziv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded singleletter distortion measures) is demonstrated: As the database si ..."
Abstract
 Add to MetaCart
Abstract — A new lossy variant of the FixedDatabase Lempel–Ziv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded singleletter distortion measures) is demonstrated: As the database
On Generalized Digital Search Trees With Applications To A Generalized LempelZiv Algorithm
, 1995
"... The goal of this research is twofold: (i) to analyze generalized digital search trees, and (ii) to derive the average profile (i.e., phrase length) of a generalization of the well known parsing algorithm due to Lempel and Ziv. In the generalized LempelZiv parsing scheme, one partitions a sequence o ..."
Abstract
 Add to MetaCart
The goal of this research is twofold: (i) to analyze generalized digital search trees, and (ii) to derive the average profile (i.e., phrase length) of a generalization of the well known parsing algorithm due to Lempel and Ziv. In the generalized LempelZiv parsing scheme, one partitions a sequence
Average Profile Of The Generalized Digital Search Tree And The Generalized LempelZiv Algorithm
, 1997
"... The goal of this research is threefold: (i) to analyze generalized digital search trees, (ii) to derive the average profile (i.e., phrase length) of a generalization of the well known parsing algorithm due to Lempel and Ziv, and (iii) to provide analytical tools to analyze asymptotically certain par ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
The goal of this research is threefold: (i) to analyze generalized digital search trees, (ii) to derive the average profile (i.e., phrase length) of a generalization of the well known parsing algorithm due to Lempel and Ziv, and (iii) to provide analytical tools to analyze asymptotically certain
Music indexing with extracted main melody by using modified lempelziv algorithm
 in International Symposium on the Convergence of IT and Communiactions (ITCOM
, 2001
"... Extraction of repetitive patterns of the main melody in a given music piece is investigated in this research. A dictionarybased approach is proposed to achieve the task. The input to the proposed system is a piece of music consisting of numerical music scores (e.g. the MIDI file format), and other m ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
based algorithm known as the Lempel Ziv 78 (LZ78) is modified and applied to the barrepresented music scores to extract repetitive patterns. The LZ78 algorithm is slightly modified to achieve better results, and the modified LZ78 is named the “Exhaustive Search with Progressive LEngth ” (ESPLE). After this step
An Efficient Text Compression Technique Based on Using Bitwise LempelZiv Algorithm
, 2010
"... Abstract: This paper presents an efficient data compression technique based on using LempelZiv coding algorithms such as the LZ78 algorithm. The conventional LZ78 algorithm was applied directly to a nonbinary information source (i.e., original source) with a large number of alphabets (such as 2 ..."
Abstract
 Add to MetaCart
Abstract: This paper presents an efficient data compression technique based on using LempelZiv coding algorithms such as the LZ78 algorithm. The conventional LZ78 algorithm was applied directly to a nonbinary information source (i.e., original source) with a large number of alphabets (such
An Implementable Lossy Version of the LempelZiv Algorithm  Part I: Optimality. . . Optimality for Memoryless Sources
, 1998
"... A new lossy variant of the FixedDatabase LempelZiv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded singleletter distortion measures) is demonstrated: As the database size m increa ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
A new lossy variant of the FixedDatabase LempelZiv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded singleletter distortion measures) is demonstrated: As the database size m
On Match Lengths and the Asymptotic Behavior of Sliding Window LempelZiv Algorithm for Zero Entropy Sequences
"... Abstract—The Sliding Window LempelZiv (SWLZ) algorithm has been studied from various perspectives in information theory literature. In this paper, we provide a general law which defines the asymptotics of match length for stationary and ergodic zero entropy processes. Moreover, we use this law to c ..."
Abstract
 Add to MetaCart
Abstract—The Sliding Window LempelZiv (SWLZ) algorithm has been studied from various perspectives in information theory literature. In this paper, we provide a general law which defines the asymptotics of match length for stationary and ergodic zero entropy processes. Moreover, we use this law
On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm
"... Abstract — The sliding window Lempel–Ziv (SWLZ) algorithm that makes use of recurrence times and match lengths has been studied from various perspectives in information theory literature. In this paper, we undertake a finer study of these quantities under two different scenarios: 1) zero entropy sou ..."
Abstract
 Add to MetaCart
Abstract — The sliding window Lempel–Ziv (SWLZ) algorithm that makes use of recurrence times and match lengths has been studied from various perspectives in information theory literature. In this paper, we undertake a finer study of these quantities under two different scenarios: 1) zero entropy
Results 1  10
of
4,288