Joint source-channel coding and guessing

dc.citation.spage162
dc.contributor.authorArıkan, Erdal
dc.contributor.authorMerhav, N.
dc.date.accessioned2016-02-08T12:00:08Z
dc.date.available2016-02-08T12:00:08Z
dc.date.issued1997-06-07
dc.departmentDepartment of Computer Engineering
dc.departmentDepartment of Electrical and Electronics Engineering
dc.descriptionDate of Conference: 29 June-4 July 1997
dc.descriptionConference name: Proceedings of IEEE International Symposium on Information Theory
dc.description.abstractWe consider the joint source-channel guessing problem, define measures of optimum performance, and give single-letter characterizations. As an application, sequential decoding is considered.
dc.identifier.doi10.1109/ISIT.1997.613077
dc.identifier.urihttp://hdl.handle.net/11693/27717
dc.language.isoEnglish
dc.publisherIEEE
dc.relation.isversionofhttps://doi.org/10.1109/ISIT.1997.613077
dc.source.titleProceedings of IEEE International Symposium on Information Theory
dc.subjectCommunication channels (information theory)
dc.subjectFunctions
dc.subjectMathematical models
dc.subjectProbability
dc.subjectJoint source channel coding
dc.subjectSignal encoding
dc.titleJoint source-channel coding and guessing
dc.typeConference Paper

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Joint_source_channel_coding_and_guessing.pdf
Size:
120.03 KB
Format:
Adobe Portable Document Format
Description: