The complexity of minimum redundancy coding

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

186 Downloads (Pure)

Originele taal-2	Engels
Titel	Proceedings of the 21st Symposium on Information Theory in the Benelux, May 25-26, Wassenaar, The Netherlands
Pagina's	247-254
Status	Gepubliceerd - 2000
Evenement	2000 Symposium on Information Theory in the Benelux, SITB 2000 - Wassenaar, Nederland Duur: 25 mei 2000 → 26 mei 2000 Congresnummer: 21

Congres	2000 Symposium on Information Theory in the Benelux, SITB 2000
Verkorte titel	SITB 2000
Land/Regio	Nederland
Stad	Wassenaar
Periode	25/05/00 → 26/05/00
Ander	21st Symposium on Information Theory in the Benelux

Toegang tot document

@inproceedings{65aa8444094c45f48f024ab2b08aa508,

title = "The complexity of minimum redundancy coding",

author = "T.J. Tjalkens",

year = "2000",

language = "English",

pages = "247--254",

booktitle = "Proceedings of the 21st Symposium on Information Theory in the Benelux, May 25-26, Wassenaar, The Netherlands",

note = "2000 Symposium on Information Theory in the Benelux, SITB 2000, SITB 2000 ; Conference date: 25-05-2000 Through 26-05-2000",

}

TY - GEN

T1 - The complexity of minimum redundancy coding

AU - Tjalkens, T.J.

N1 - Conference code: 21

PY - 2000

Y1 - 2000

M3 - Conference contribution

SP - 247

EP - 254

BT - Proceedings of the 21st Symposium on Information Theory in the Benelux, May 25-26, Wassenaar, The Netherlands

T2 - 2000 Symposium on Information Theory in the Benelux, SITB 2000

Y2 - 25 May 2000 through 26 May 2000

ER -