Joint source-channel coding and guessing
dc.citation.spage | 162 | en_US |
dc.contributor.author | Arıkan, Erdal | en_US |
dc.contributor.author | Merhav, N. | en_US |
dc.date.accessioned | 2016-02-08T12:00:08Z | |
dc.date.available | 2016-02-08T12:00:08Z | |
dc.date.issued | 1997-06-07 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 29 June-4 July 1997 | |
dc.description | Conference name: Proceedings of IEEE International Symposium on Information Theory | |
dc.description.abstract | We consider the joint source-channel guessing problem, define measures of optimum performance, and give single-letter characterizations. As an application, sequential decoding is considered. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T12:00:08Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1997 | en |
dc.identifier.doi | 10.1109/ISIT.1997.613077 | |
dc.identifier.uri | http://hdl.handle.net/11693/27717 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/ISIT.1997.613077 | |
dc.source.title | Proceedings of IEEE International Symposium on Information Theory | en_US |
dc.subject | Communication channels (information theory) | en_US |
dc.subject | Functions | en_US |
dc.subject | Mathematical models | en_US |
dc.subject | Probability | en_US |
dc.subject | Joint source channel coding | en_US |
dc.subject | Signal encoding | en_US |
dc.title | Joint source-channel coding and guessing | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Joint_source_channel_coding_and_guessing.pdf
- Size:
- 120.03 KB
- Format:
- Adobe Portable Document Format
- Description: