| Presentation | 2022-03-11 Achievable rate of multi-letter Ahlswede-Han scheme for modulo-sum problem Takuto Kakishima, Shun Watanabe, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The achievable sum-rate of modulo-sum problem for two sources according to i.i.d. is investigated. We calculate the sum-rate by expanding Ahlswede and Han's result to $2^m$-letter. In addition, the equation of the sum-rate can be deformed to the equation having only the variables used to express probablity distribution the sources are according to. As a result, it turns out that the achievable sum-rate we calculated is smaller than the above sum-rate. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Source coding / Ahlswede-Han / modulo-sum problem / achievable rate |
| Paper # | IT2021-120,ISEC2021-85,WBS2021-88,RCC2021-95 |
| Date of Issue | 2022-03-03 (IT, ISEC, WBS, RCC) |
| Conference Information | |
| Committee | IT / ISEC / RCC / WBS |
|---|---|
| Conference Date | 2022/3/10(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Joint Meeting of ISEC, IT, RCC, and WBS |
| Chair | Tadashi Wadayama(Nagoya Inst. of Tech.) / Tetsuya Izu(Fujitsu Labs.) / HUAN-BANG LI(NICT) / Masanori Hamamura(Kochi Univ. of Tech.) |
| Vice Chair | Tetsuya Kojima(Tokyo Kosen) / Noboru Kunihiro(Tsukuba Univ.) / Goichiro Hanaoka(AIST) / Shunichi Azuma(Nagoya Univ.) / Koji Ishii(Kagawa Univ.) / Takashi Shono(INTEL) / Masahiro Fujii(Utsunomiya Univ.) |
| Secretary | Tetsuya Kojima(Saitamai Univ.) / Noboru Kunihiro(Yamaguchi Univ.) / Goichiro Hanaoka(Fujitsu Labs.) / Shunichi Azuma(Ibaraki Univ.) / Koji Ishii(CRIEPI) / Takashi Shono(Osaka Univ.) / Masahiro Fujii(National Defence Academy) |
| Assistant | Masanori Hirotomo(Saga Univ.) / Takahiro Matsuda(AIST) / SHAN LIN(NICT) / Masaki Ogura(Osaka Univ.) / Masayuki Kinoshita(Chiba Univ. of Tech.) / Sun Ran(Ibaraki Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Information Theory / Technical Committee on Information Security / Technical Committee on Reliable Communication and Control / Technical Committee on Wideband System |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Achievable rate of multi-letter Ahlswede-Han scheme for modulo-sum problem |
| Sub Title (in English) | |
| Keyword(1) | Source coding |
| Keyword(2) | Ahlswede-Han |
| Keyword(3) | modulo-sum problem |
| Keyword(4) | achievable rate |
| 1st Author's Name | Takuto Kakishima |
| 1st Author's Affiliation | Tokyo University of Agriculture and Technology(TUAT) |
| 2nd Author's Name | Shun Watanabe |
| 2nd Author's Affiliation | Tokyo University of Agriculture and Technology(TUAT) |
| Date | 2022-03-11 |
| Paper # | IT2021-120,ISEC2021-85,WBS2021-88,RCC2021-95 |
| Volume (vol) | vol.121 |
| Number (no) | IT-428,ISEC-429,WBS-430,RCC-431 |
| Page | pp.pp.221-226(IT), pp.221-226(ISEC), pp.221-226(WBS), pp.221-226(RCC), |
| #Pages | 6 |
| Date of Issue | 2022-03-03 (IT, ISEC, WBS, RCC) |