| Presentation | 2021-01-21 Channel Coding Theorem with Asymptotic Cost Constraint Allowing Decoding Error and Cost Overrun Masaki Hori, Mikihiko Nishiara, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider a problem where the cost is defined over the coding alphabet in the channel coding problem. Such a problem is called a cost constraint problem. In the conventional problem setting, the cost constraint on the codeword must be satisfied for every block length, while the coding rate is defined asymptotically with respect to the block length. In this study, we consider a channel coding problem for general channels with asymptotic cost constraints on the codewords. Specifically, we clarified the channel capacity allowing decoding error and cost overrun simultaneously. However, a strong assumption is made in the derivation of the direct part of the theorem. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | channel coding theorem / Shannon theorem / general channels / cost constraint problem |
| Paper # | IT2020-83,SIP2020-61,RCS2020-174 |
| Date of Issue | 2021-01-14 (IT, SIP, RCS) |
| Conference Information | |
| Committee | SIP / IT / RCS |
|---|---|
| Conference Date | 2021/1/21(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Kazunori Hayashi(Kyoto Univ.) / Tadashi Wadayama(Nagoya Inst. of Tech.) / Eiji Okamoto(Nagoya Inst. of Tech.) |
| Vice Chair | Yukihiro Bandou(NTT) / Toshihisa Tanaka(Tokyo Univ. Agri.&Tech.) / Tetsuya Kojima(Tokyo Kosen) / Fumiaki Maehara(Waseda Univ.) / Toshihiko Nishimura(Hokkaido Univ.) / Tomoya Tandai(Toshiba) |
| Secretary | Yukihiro Bandou(Hosei Univ.) / Toshihisa Tanaka(Waseda Univ.) / Tetsuya Kojima(Yamaguchi Univ.) / Fumiaki Maehara(Saga Univ.) / Toshihiko Nishimura(Kyushu Univ.) / Tomoya Tandai(NEC) |
| Assistant | Yuichi Tanaka(Tokyo Univ. Agri.&Tech.) / Takahiro Ohta(Senshu Univ.) / Koichi Adachi(Univ. of Electro-Comm.) / Osamu Nakamura(Sharp) / Manabu Sakai(Mitsubishi Electric) / Masashi Iwabuchi(NTT) / Tatsuki Okuyama(NTT DOCOMO) |
| Paper Information | |
| Registration To | Technical Committee on Signal Processing / Technical Committee on Information Theory / Technical Committee on Radio Communication Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Channel Coding Theorem with Asymptotic Cost Constraint Allowing Decoding Error and Cost Overrun |
| Sub Title (in English) | |
| Keyword(1) | channel coding theorem |
| Keyword(2) | Shannon theorem |
| Keyword(3) | general channels |
| Keyword(4) | cost constraint problem |
| 1st Author's Name | Masaki Hori |
| 1st Author's Affiliation | Shinshu University(Shinshu Univ.) |
| 2nd Author's Name | Mikihiko Nishiara |
| 2nd Author's Affiliation | Shinshu University(Shinshu Univ.) |
| Date | 2021-01-21 |
| Paper # | IT2020-83,SIP2020-61,RCS2020-174 |
| Volume (vol) | vol.120 |
| Number (no) | IT-320,SIP-321,RCS-322 |
| Page | pp.pp.107-112(IT), pp.107-112(SIP), pp.107-112(RCS), |
| #Pages | 6 |
| Date of Issue | 2021-01-14 (IT, SIP, RCS) |