| Presentation | 2022-01-21 Slepian-Wolf Coding Theorems Considering Costs for Codewords Naoki Ueda, Tomohiko Uyematsu, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Many codes used for source coding assume that the costs for transmitting and recording each symbol are uniform, and codes are designed to minimize the average length of codewords for a given source. However, in the transmission and recording of information, it seems to be natural that each symbol has a different cost, and codes that minimize the costs of codewords are required. In this paper, we deal with two types of costs for codewords: regular costs and finite state costs. We consider the Slepian-Wolf coding problem for stationary memoryless sources, and clarify the achievable rate region of the maximum cost rates, which are defined by the maximum value of the costs for codewords per symbols. Furthermore, we also clarify the achievable rate region for the average cost rates, which are defined by the average value of the costs for codewords per symbols. Further, in the case of stationary memoryless sources, we show that these two achievable rate regions are identical. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Slepian-Wolf coding / cost rate / achievable rate region / stationary memoryless source / cost for codeword |
| Paper # | IT2021-81,SIP2021-89,RCS2021-249 |
| Date of Issue | 2022-01-13 (IT, SIP, RCS) |
| Conference Information | |
| Committee | RCS / SIP / IT |
|---|---|
| Conference Date | 2022/1/20(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Eiji Okamoto(Nagoya Inst. of Tech.) / Yukihiro Bandou(NTT) / Tadashi Wadayama(Nagoya Inst. of Tech.) |
| Vice Chair | Toshihiko Nishimura(Hokkaido Univ.) / Tomoya Tandai(Toshiba) / Fumihide Kojima(NICT) / Toshihisa Tanaka(Tokyo Univ. Agri.&Tech.) / Takayuki Nakachi(Ryukyu Univ.) / Tetsuya Kojima(Tokyo Kosen) |
| Secretary | Toshihiko Nishimura(NEC) / Tomoya Tandai(Panasonic) / Fumihide Kojima(Xiaomi) / Toshihisa Tanaka(Takushoku Univ.) / Takayuki Nakachi(Tokyo Univ. Agri.&Tech.) / Tetsuya Kojima(Saitamai Univ.) |
| Assistant | Koichi Adachi(Univ. of Electro-Comm.) / Osamu Nakamura(Sharp) / Manabu Sakai(Mitsubishi Electric) / Masashi Iwabuchi(NTT) / Tatsuki Okuyama(NTT DOCOMO) / Taichi Yoshida(UEC) / Seisuke Kyochi(Univ. of Kitakyushu) / Masanori Hirotomo(Saga Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Radio Communication Systems / Technical Committee on Signal Processing / Technical Committee on Information Theory |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Slepian-Wolf Coding Theorems Considering Costs for Codewords |
| Sub Title (in English) | |
| Keyword(1) | Slepian-Wolf coding |
| Keyword(2) | cost rate |
| Keyword(3) | achievable rate region |
| Keyword(4) | stationary memoryless source |
| Keyword(5) | cost for codeword |
| 1st Author's Name | Naoki Ueda |
| 1st Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| 2nd Author's Name | Tomohiko Uyematsu |
| 2nd Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| Date | 2022-01-21 |
| Paper # | IT2021-81,SIP2021-89,RCS2021-249 |
| Volume (vol) | vol.121 |
| Number (no) | IT-327,SIP-328,RCS-329 |
| Page | pp.pp.295-300(IT), pp.295-300(SIP), pp.295-300(RCS), |
| #Pages | 6 |
| Date of Issue | 2022-01-13 (IT, SIP, RCS) |