Show simple item record

dc.contributor.authorArıkan, E.en_US
dc.date.accessioned2016-02-08T10:56:28Z
dc.date.available2016-02-08T10:56:28Z
dc.date.issued1990en_US
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/26208
dc.description.abstractThe achievable-rate region of sequential decoding for the class of pairwise reversible multiaccess channels is determined. This result is obtained by finding tight lower bounds to the average list size for the same class of channels. The average list size is defined as the expected number of incorrect messages that appear, to a maximum-likelihood decoder, to be at least as likely as the correct message. The average list size bounds developed here may be of independent interest, with possible applications to list-decoding schemes. © 1990 IEEEen_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/18.50387en_US
dc.titleOn the achievable rate region of sequential decoding for a class of multiaccess channelsen_US
dc.typeArticleen_US
dc.departmentDepartment of Electrical and Electronics Engineering
dc.citation.spage180en_US
dc.citation.epage183en_US
dc.citation.volumeNumber36en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1109/18.50387en_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record