An upper bound on the zero-error list-coding capacity
dc.citation.epage | 1240 | en_US |
dc.citation.issueNumber | 4 | en_US |
dc.citation.spage | 1237 | en_US |
dc.citation.volumeNumber | 40 | en_US |
dc.contributor.author | Arikan, E. | en_US |
dc.date.accessioned | 2015-07-28T12:07:13Z | |
dc.date.available | 2015-07-28T12:07:13Z | |
dc.date.issued | 1994-07 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.abstract | We 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.provenance | Made 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.doi | 10.1109/18.335947 | en_US |
dc.identifier.eissn | 1557-9654 | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | http://hdl.handle.net/11693/13611 | |
dc.institute | IEEE | en_US |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/18.335947 | en_US |
dc.subject | Zero-error Capacity | en_US |
dc.subject | List-coding | en_US |
dc.subject | Perfect-hashing | en_US |
dc.subject | Graph-entrok | en_US |
dc.subject | Shannon capacity of graphs | en_US |
dc.title | An upper bound on the zero-error list-coding capacity | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 10.1109-18.335947.pdf
- Size:
- 500.17 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version