A bound on the zero-error list coding capacity

Files

Bound on the zero error list coding capacity.pdf (87.27 KB)

Date

1993

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
0
views
33
downloads

Citation Stats

  • Share

Series

Abstract

We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of the bound to the graph-entropy bound of Koerner and Marton is also discussed.

Source Title

Proceedings of the International Symposium on Information Theory, IEEE 1993

Publisher

IEEE

Course

Other identifiers

Book Title

Keywords

Entropy, Error correction, Graph theory, Information theory, Coding capacity, Memoryless systems

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/27804

Published Version (Please cite this version)

https://doi.org/10.1109/ISIT.1993.748467

Collections

Scholarly Publications - Electrical and Electronics Engineering

Language

English

Type

Conference Paper