On the average redundancy rate of the Lempel–Ziv code with the k-error protocol

Yuriy A. Reznik، نويسنده , , Wojciech Szpankowski، نويسنده ,

روزنامه با شماره پیاپی سال 2001

14

57

70

Digital search trees , Data compression , asymptotic analysis , k-error protocol , Generalized Lempel–Ziv scheme , error propagation , Average redundancy rate , Lempel–Ziv parsing scheme

Information Sciences

2001

Information Sciences

176232