György, András and Linder, Tamás and Chou, PA and Betts, BJ (2003) Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? IEEE TRANSACTIONS ON INFORMATION THEORY, 49 (11). pp. 3031-3037.

Full text not available from this repository.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Informatics Laboratory
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 15:11
Last Modified:	11 Dec 2012 15:11
URI:	https://eprints.sztaki.hu/id/eprint/3239

Update Item