Universal rateless coding with finite message set

Navot Blits; Meir Feder

doi:10.1109/ISIT.2012.6283583

Universal rateless coding with finite message set

Navot Blits^*, Meir Feder

^*Corresponding author for this work

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

Universal rateless coding over unknown discrete memoryless channels (DMC) is considered. In rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level of the decoder. This work considers the finite message set case where a finite number of bits are transmitted over an unknown discrete memoryless channel, with a fix allowed error probability. Using rateless codes along with sequential universal decoding that utilizes a mixture probability law instead of the unknown channel law, an optimal universal scheme is obtained. The analysis specifies explicitly the attainable rate, at each message set size and allowed error probability, which reflects the cost of universality.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	1772-1776
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283583
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

Access to Document

10.1109/ISIT.2012.6283583

Cite this

@inproceedings{ad4daeff47cf4dfd94bd1eccf2b65d72,

title = "Universal rateless coding with finite message set",

abstract = "Universal rateless coding over unknown discrete memoryless channels (DMC) is considered. In rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level of the decoder. This work considers the finite message set case where a finite number of bits are transmitted over an unknown discrete memoryless channel, with a fix allowed error probability. Using rateless codes along with sequential universal decoding that utilizes a mixture probability law instead of the unknown channel law, an optimal universal scheme is obtained. The analysis specifies explicitly the attainable rate, at each message set size and allowed error probability, which reflects the cost of universality.",

author = "Navot Blits and Meir Feder",

year = "2012",

doi = "10.1109/ISIT.2012.6283583",

language = "אנגלית",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1772--1776",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Blits, N & Feder, M 2012, Universal rateless coding with finite message set. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283583, IEEE International Symposium on Information Theory - Proceedings, pp. 1772-1776, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6283583

TY - GEN

T1 - Universal rateless coding with finite message set

AU - Blits, Navot

AU - Feder, Meir

PY - 2012

Y1 - 2012

N2 - Universal rateless coding over unknown discrete memoryless channels (DMC) is considered. In rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level of the decoder. This work considers the finite message set case where a finite number of bits are transmitted over an unknown discrete memoryless channel, with a fix allowed error probability. Using rateless codes along with sequential universal decoding that utilizes a mixture probability law instead of the unknown channel law, an optimal universal scheme is obtained. The analysis specifies explicitly the attainable rate, at each message set size and allowed error probability, which reflects the cost of universality.

AB - Universal rateless coding over unknown discrete memoryless channels (DMC) is considered. In rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level of the decoder. This work considers the finite message set case where a finite number of bits are transmitted over an unknown discrete memoryless channel, with a fix allowed error probability. Using rateless codes along with sequential universal decoding that utilizes a mixture probability law instead of the unknown channel law, an optimal universal scheme is obtained. The analysis specifies explicitly the attainable rate, at each message set size and allowed error probability, which reflects the cost of universality.

UR - http://www.scopus.com/inward/record.url?scp=84867542538&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6283583

DO - 10.1109/ISIT.2012.6283583

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84867542538

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1772

EP - 1776

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Universal rateless coding with finite message set

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this