A bound on the zero-error list coding capacity
dc.citation.spage | 152 | en_US |
dc.contributor.author | Arıkan, Erdal | en_US |
dc.coverage.spatial | San Antonio, TX, USA | en_US |
dc.date.accessioned | 2016-02-08T12:02:04Z | |
dc.date.available | 2016-02-08T12:02:04Z | |
dc.date.issued | 1993 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 17-22 January 1993 | en_US |
dc.description | Conference Name: International Symposium on Information Theory, IEEE 1993 | en_US |
dc.description.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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T12:02:04Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1993 | en |
dc.identifier.doi | 10.1109/ISIT.1993.748467 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27804 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/ISIT.1993.748467 | en_US |
dc.source.title | Proceedings of the International Symposium on Information Theory, IEEE 1993 | en_US |
dc.subject | Entropy | en_US |
dc.subject | Error correction | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Information theory | en_US |
dc.subject | Coding capacity | en_US |
dc.subject | Memoryless systems | en_US |
dc.title | A bound on the zero-error list coding capacity | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Bound on the zero error list coding capacity.pdf
- Size:
- 87.27 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version