An upper bound on the zero-error list-coding capacity

Simple item page
dc.citation.epage1240en_US
dc.citation.issueNumber4en_US
dc.citation.spage1237en_US
dc.citation.volumeNumber40en_US
dc.contributor.authorArikan, E.en_US
dc.date.accessioned2015-07-28T12:07:13Z
dc.date.available2015-07-28T12:07:13Z
dc.date.issued1994-07en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe present an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list3 capacity of the 4/3 channel is at most 03512 b, improving the best previous bound. The relatien of the bound to earlier similar bouads, in particular, to Korner's graph+ntropy bound, is discussed.en_US
dc.description.provenanceMade available in DSpace on 2015-07-28T12:07:13Z (GMT). No. of bitstreams: 1 10.1109-18.335947.pdf: 512175 bytes, checksum: 72fa18a10c7d122098173a46b7ba9220 (MD5)en
dc.identifier.doi10.1109/18.335947en_US
dc.identifier.eissn1557-9654
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/13611
dc.instituteIEEEen_US
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/18.335947en_US
dc.subjectZero-error Capacityen_US
dc.subjectList-codingen_US
dc.subjectPerfect-hashingen_US
dc.subjectGraph-entroken_US
dc.subjectShannon capacity of graphsen_US
dc.titleAn upper bound on the zero-error list-coding capacityen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
10.1109-18.335947.pdf
Size:
500.17 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering