2n) which is an improvement from the previous bound of H + H(1 + o(1))log₂ log₂n/ log₂n . We use the definition of compression ratio as in Yang and Kieffer [2]. Here H is the entropy rate of the source and n is the size of the database. Then using the same definition of compression ratio we obtain an upper bound on the contribution of phrase length bits for the variant of FDLZ suggested in [3] to be O(1/ log₂n), which gives an upper bound of O(1/ log₂n) on the redundancy rate itself for this version of FDLZ.">

On redundancy rate of FDLZ algorithm and its variants (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.