Vai al contenuto principale della pagina

Data Compression Conference: Proceedings Conference, Snowbird, Utah, 2000



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Data Compression Conference: Proceedings Conference, Snowbird, Utah, 2000 Visualizza cluster
Pubblicazione: [Place of publication not identified], : IEEE Computer Society Press, 2000
Descrizione fisica: 1 online resource (586 pages)
Disciplina: 005.746
Soggetto topico: Data compression (Computer science)
Persona (resp. second.): CohnMartin
Note generali: Bibliographic Level Mode of Issuance: Monograph
Sommario/riassunto: A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}i=1∞ and {Yi }i=1∞ is drawn i.i.d. according to the joint probability mass function (p.m.f.) p(x,y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. The work of Slepian and Wolf (1973) describes all rates achievable by MASCs with arbitrarily small but non-zero error probabilities but does not address truly lossless coding or code design. We consider practical code design for lossless and near lossless MASCs. We generalize the Huffman and arithmetic code design algorithms to attain the corresponding optimal MASC codes for arbitrary p.m.f. p(x,y). Experimental results comparing the optimal achievable rate region to the Slepian-Wolf region are included.
Titolo autorizzato: Data Compression Conference: Proceedings Conference, Snowbird, Utah, 2000  Visualizza cluster
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910872643403321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui