Variable-to-fixed length codes and plurally parsable dictionaries Conference Paper

abstract

• 1999 IEEE. We introduce the idea of plurally parsable dictionaries. For small to moderate dictionary sizes, we show how to design plurally parsable dictionaries that can outperform the optimal uniquely parsable (i.e., Tunstall) dictionary of the same size on very predictable binary, memoryless sources.

name of conference

• 1999 Information Theory and Networking Workshop (Cat. No.99EX371)

authors

• Savari, Serap

published proceedings

• 1999 Information Theory and Networking Workshop (Cat. No.99EX371)

author list (cited authors)

• Savari, S. A.

citation count

• 2

complete list of authors

• Savari, SA

publication date

• January 1999

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/itnw.1999.814362

International Standard Book Number (ISBN) 10

• 0780359542

start page

• 55

volume

• 1999-June

URL

• http://dx.doi.org/10.1109/itnw.1999.814362