Almost lossless variable-length source coding on countably infinite alphabets

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, the notion of almost lossless source coding is introduced. This idea -analog to the weak variable-length source coding problem proposed by Han [1]- aims at relaxing the lossless block-wise assumptio...

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Symposium on Information Theory pp. 1 - 5
Main Authors:	Silva, Jorge F., Piantanida, Pablo
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.07.2016
Subjects:	Alphabets Asymptotic properties Channel coding Coding Distortion Entropy Feasibility Information theory Lossless Redundancy Source coding Statistics
ISSN:	2157-8117
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!