A lower bound on compression of unknown alphabets
Under an Elsevier user license
open archive
Keywords
Large and unknown alphabets
Patterns
Saddle point approximations (Hayman's theorem)
Universal compression
Cited by (0)
Copyright © 2004 Published by Elsevier B.V.