A bound on the zero-error list coding capacity

Simple item page
dc.citation.spage152en_US
dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialSan Antonio, TX, USAen_US
dc.date.accessioned2016-02-08T12:02:04Z
dc.date.available2016-02-08T12:02:04Z
dc.date.issued1993en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 17-22 January 1993en_US
dc.descriptionConference Name: International Symposium on Information Theory, IEEE 1993en_US
dc.description.abstractWe 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.identifier.doi10.1109/ISIT.1993.748467en_US
dc.identifier.urihttp://hdl.handle.net/11693/27804
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttps://doi.org/10.1109/ISIT.1993.748467en_US
dc.source.titleProceedings of the International Symposium on Information Theory, IEEE 1993en_US
dc.subjectEntropyen_US
dc.subjectError correctionen_US
dc.subjectGraph theoryen_US
dc.subjectInformation theoryen_US
dc.subjectCoding capacityen_US
dc.subjectMemoryless systemsen_US
dc.titleA bound on the zero-error list coding capacityen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Bound on the zero error list coding capacity.pdf
Size:
87.27 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Electrical and Electronics Engineering