Some results on zero-error capacity under list decoding

Simple item page
dc.citation.spage15en_US
dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialSan Diego, California, USAen_US
dc.date.accessioned2016-02-08T12:02:26Zen_US
dc.date.available2016-02-08T12:02:26Zen_US
dc.date.issued1990en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 14-19 January 1990en_US
dc.descriptionConference Name: IEEE International Symposium on Information Theory, ISIT 1990en_US
dc.description.abstractSummary form only given. A number of questions recently raised by Elias regarding a zero-error list-of-L code have been addressed. It has been shown that computing the zero-error capacity of the channel with feedback is NP-complete, and bounds on the size of the code have been obtained.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:02:26Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1990en
dc.identifier.urihttp://hdl.handle.net/11693/27824en_US
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.source.titleProceedings of the IEEE International Symposium on Information Theory, ISIT 1990en_US
dc.subjectCodes, symbolicen_US
dc.subjectComputer metatheoryen_US
dc.subjectFeedback channelsen_US
dc.subjectList decodingen_US
dc.subjectNP completenessen_US
dc.subjectZero error capacityen_US
dc.subjectInformation theoryen_US
dc.subjectComputational complexityen_US
dc.titleSome results on zero-error capacity under list decodingen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
bilkent-research-paper.pdf
Size:
68.58 KB
Format:
Adobe Portable Document Format
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering