| Presentation | 2019-02-01 Linear Permutation Polynomial Codes Ryoichiro Yoshida, Kenta Kasai, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They have two drawbacks: lack of randomness and limited girth lead to degraded decoding performance in waterfall and error floor regions, respectively. To tackle these problems, we present a new class of LDPC codes, named linear permutation polynomial (LPP) codes, whose parity-check matrix consists of permutation matrices based on LPPs. The girth of CPM codes is upper bounded by 12, while LPP codes break this limit. We demonstrate that LPP codes have error performance almost equivalent to random ones. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | low-density parity-check (LDPC) codes / quasi-cyclic LDPC (QC-LDPC) codes / permutation matrix / linear permutation polynomial (LPP) / LPP codes |
| Paper # | IT2018-63,SIP2018-93,RCS2018-270 |
| Date of Issue | 2019-01-24 (IT, SIP, RCS) |
| Conference Information | |
| Committee | RCS / SIP / IT |
|---|---|
| Conference Date | 2019/1/31(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Osaka University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Tomoaki Otsuki(Keio Univ.) / Shogo Muramatsu(Niigata Univ.) / Jun Muramatsu(NTT) |
| Vice Chair | Eisuke Fukuda(Fujitsu Labs.) / Satoshi Suyama(NTT DoCoMo) / Fumiaki Maehara(Waseda Univ.) / Naoyuki Aikawa(TUS) / Kazunori Hayashi(Osaka City Univ) / Tadashi Wadayama(Nagoya Inst. of Tech.) |
| Secretary | Eisuke Fukuda(Hokkaido Univ.) / Satoshi Suyama(NTT) / Fumiaki Maehara(Takushoku Univ.) / Naoyuki Aikawa(Hiroshima Univ.) / Kazunori Hayashi(Nagano Pref Inst. of Tech.) / Tadashi Wadayama(UEC) |
| Assistant | Kazushi Muraoka(NTT DOCOMO) / Shinsuke Ibi(Osaka Univ.) / Hiroshi Nishimoto(Mitsubishi Electric) / Koichi Adachi(Univ. of Electro-Comm.) / Osamu Nakamura(Sharp) / Katsumi Konishi(Hosei Univ.) / hyihsin(Takushoku Univ.) / Takahiro Yoshida(Yokohama College of Commerce) |
| 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) | Linear Permutation Polynomial Codes |
| Sub Title (in English) | |
| Keyword(1) | low-density parity-check (LDPC) codes |
| Keyword(2) | quasi-cyclic LDPC (QC-LDPC) codes |
| Keyword(3) | permutation matrix |
| Keyword(4) | linear permutation polynomial (LPP) |
| Keyword(5) | LPP codes |
| 1st Author's Name | Ryoichiro Yoshida |
| 1st Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| 2nd Author's Name | Kenta Kasai |
| 2nd Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| Date | 2019-02-01 |
| Paper # | IT2018-63,SIP2018-93,RCS2018-270 |
| Volume (vol) | vol.118 |
| Number (no) | IT-433,SIP-434,RCS-435 |
| Page | pp.pp.161-166(IT), pp.161-166(SIP), pp.161-166(RCS), |
| #Pages | 6 |
| Date of Issue | 2019-01-24 (IT, SIP, RCS) |