A Memory-Efficient Adaptive Huffman Coding Algorthm for Very Large Sets of Symbols

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by S. Pigeon Articles by Y. Bengio

Data Compression Conference 1998

Snowbird, Utah

March 30-April 01

ISBN: 0-8186-8406-2

	ASCII Text	x
	S. Pigeon, Y. Bengio, "A Memory-Efficient Adaptive Huffman Coding Algorthm for Very Large Sets of Symbols," Data Compression Conference, pp. 0568, Data Compression Conference 1998, 1998.

	BibTex	x
	@article{ 10.1109/DCC.1998.672310, author = {S. Pigeon and Y. Bengio}, title = {A Memory-Efficient Adaptive Huffman Coding Algorthm for Very Large Sets of Symbols}, journal ={Data Compression Conference}, volume = {0}, year = {1998}, isbn = {0-8186-8406-2}, pages = {0568}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.1998.672310}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Compression Conference TI - A Memory-Efficient Adaptive Huffman Coding Algorthm for Very Large Sets of Symbols SN - 0-8186-8406-2 SP EP A1 - S. Pigeon, A1 - Y. Bengio, PY - 1998 VL - 0 JA - Data Compression Conference ER -

S. Pigeon

Y. Bengio

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.1998.672310

Citation:

S. Pigeon, Y. Bengio, "A Memory-Efficient Adaptive Huffman Coding Algorthm for Very Large Sets of Symbols," dcc, pp.0568, Data Compression Conference 1998, 1998

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.