Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2016
|
| Online Access: | http://hdl.handle.net/1721.1/101007 https://orcid.org/0000-0002-2109-0979 |
| _version_ | 1811091652924669952 |
|---|---|
| author | Young, Andrew J. Polyanskiy, Yury |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Young, Andrew J. Polyanskiy, Yury |
| author_sort | Young, Andrew J. |
| collection | MIT |
| description | This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established. Although the exact value of the asymptotic noise-distortion tradeoff curve is unknown (except at ρ = 1), some initial results on inter-relations between these curves for different values of ρ are shown and lead to statements about monotonicity and continuity in ρ. |
| first_indexed | 2024-09-23T15:05:47Z |
| format | Article |
| id | mit-1721.1/101007 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:05:47Z |
| publishDate | 2016 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1010072022-10-02T00:35:45Z Converse and duality results for combinatorial source-channel coding in binary Hamming spaces Young, Andrew J. Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Young, Andrew J. Polyanskiy, Yury This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established. Although the exact value of the asymptotic noise-distortion tradeoff curve is unknown (except at ρ = 1), some initial results on inter-relations between these curves for different values of ρ are shown and lead to statements about monotonicity and continuity in ρ. National Science Foundation (U.S.) (Grant CCF-13-18620) 2016-01-27T18:03:28Z 2016-01-27T18:03:28Z 2015-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-7704-1 http://hdl.handle.net/1721.1/101007 Young, Andrew J., and Yury Polyanskiy. “Converse and Duality Results for Combinatorial Source-Channel Coding in Binary Hamming Spaces.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015). https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/ISIT.2015.7282457 Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT) Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Young, Andrew J. Polyanskiy, Yury Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title | Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title_full | Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title_fullStr | Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title_full_unstemmed | Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title_short | Converse and duality results for combinatorial source-channel coding in binary Hamming spaces |
| title_sort | converse and duality results for combinatorial source channel coding in binary hamming spaces |
| url | http://hdl.handle.net/1721.1/101007 https://orcid.org/0000-0002-2109-0979 |
| work_keys_str_mv | AT youngandrewj converseanddualityresultsforcombinatorialsourcechannelcodinginbinaryhammingspaces AT polyanskiyyury converseanddualityresultsforcombinatorialsourcechannelcodinginbinaryhammingspaces |