| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IT, RCS, SIP | 2023-01-25 14:10 |
Gunma | Maebashi Terrsa (Primary: On-site, Secondary: Online) |
Cyclic Hadamard-type Matrices on Finite Fields and Their Properties Iori Kodama, Tetsuya Kojima (NIT, Tokyo College)  IT2022-66 SIP2022-117 RCS2022-245 |
Hadamard matrix is defined as a square matrix where any components are −1 or +1, and where any pairs of rows are mutuall... [more] | IT2022-66 SIP2022-117 RCS2022-245 pp.211-216 |
| RCS, NS (Joint) |
2021-12-16 10:35 |
Nara | Nara-ken Bunka Kaikan and Online (Primary: On-site, Secondary: Online) |
Highly efficient multi-hop transmission using encryption-then-compression based on CRC-aided Polar code Ryota Yatsu, Koji Ishibashi (UEC), Hideki Endo, Sota Tsuchiya (Tokyo Gas) RCS2021-175 |
Packet aggregation with compression has been proposed as one of the methods in order to reduce the transmission time, wh... [more] | RCS2021-175 pp.1-6 |
| RCS | 2019-06-19 16:25 |
Okinawa | Miyakojima Hirara Port Terminal Building | A Study on Multilevel Coded Modulation Based on CRC-Concatenated Polar Codes Yuki Yajima, Hideki Ochiai (Yokohama National Univ.) RCS2019-60 |
Polar codes are shown to approach the channel capacity as the codeword length increases, and the recent studies have s... [more] |
RCS2019-60 pp.137-142 |
| RCS, SIP, IT | 2019-02-01 11:40 |
Osaka | Osaka University | Linear Permutation Polynomial Codes Ryoichiro Yoshida, Kenta Kasai (Tokyo Tech) IT2018-63 SIP2018-93 RCS2018-270 |
Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They hav... [more] | IT2018-63 SIP2018-93 RCS2018-270 pp.161-166 |
| IT | 2018-12-18 16:35 |
Fukushima | Spa Resort Hawaiians | [Invited Talk]
Construction and Decoding of Codes over Symbol-Pair Read Channels Masanori Hirotomo (Saga Univ.), Makoto Takita, Masakatu Morii (Kobe Univ.) IT2018-34 |
In this paper, we explain construction and decoding of codes over symbol-pair red channels. [more] | IT2018-34 pp.19-24 |
| ASN, NS, RCS, SR, RCC (Joint) |
2018-07-13 17:05 |
Hokkaido | Hakodate Arena | On Reduced-Complexity Coded MIMO Spatial Multiplexing System based on Matched-Filter Detecter and CRC-Assisted Interference Cancellation Kentaro Masukawa, Hideki Ochiai (Yokohama Natl. Univ.) RCS2018-130 |
Optimal detection of multiple-input multiple-output~(MIMO) spatial multiplexing systems becomes challenging as the nu... [more] |
RCS2018-130 pp.255-260 |
| IT, EMM | 2018-05-18 10:50 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | Hadamard-type Matrices on Finite Fields and Complete Complementary Codes Tetsuya Kojima (NIT, Tokyo College) IT2018-7 EMM2018-7 |
Hadamard matrix is defined as a square matrix where any components are $-1$ or $+1$, and where any pairs of rows are mut... [more] | IT2018-7 EMM2018-7 pp.35-40 |
| ISEC, WBS, IT | 2017-03-09 14:25 |
Tokyo | TOKAI University | Trellis Reduction for Tail-Biting Convolutional Codes Using Characteristic Matrices and Cyclically Shifted Code-Subsequences Masato Tajima IT2016-108 ISEC2016-98 WBS2016-84 |
Trellis reduction for tail-biting convolutional codes is investigated. A given tail-biting (TB) convolutional code is re... [more] | IT2016-108 ISEC2016-98 WBS2016-84 pp.61-66 |
| IT | 2016-09-02 11:25 |
Saga | New Heartpia | Consideration of continuous elements pattern for Roos bound on cyclic codes Junru Zheng (Kyushu Women's Univ.), Takayasu Kaida (Kinndai Univ.) IT2016-38 |
For cyclic codes, many lower bounds are suggested. The Roos bound is one of the well-known lower bounds for the minimu... [more] |
IT2016-38 pp.25-28 |
| IT | 2014-09-19 09:25 |
Chiba | On Decoding Method of Cyclic Codes over Symbol-Pair Read Channels Makoto Takita (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2014-42 |
Cassuto and Blaum proposed new error correcting codes which are called symbol-pair codes. They gave a coding framework f... [more] | IT2014-42 pp.7-12 |
|
| IT | 2014-07-18 16:15 |
Hyogo | Kobe University | On Applications for Complex Modulation by Constant-Weight and Multi-Valued Codes Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyusyhu Women's Univ.), Keiichi Takahashi (Kinki Univ.) IT2014-38 |
For transmission of information, a method using the values in the constant-weight and multi-valued code that is proposed... [more] | IT2014-38 pp.149-152 |
| IT | 2013-07-26 16:10 |
Tokyo | Nishi-Waseda campus, Waseda University | A Method for Computing the Minimum Pair Distance of Cyclic Codes Takuya Sugimoto (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2013-30 |
Cassuto and Blaum proposed new error correcting codes which are called {it symbol-pair codes}. They gave a coding frame... [more] |
IT2013-30 pp.95-100 |
| IT | 2013-05-24 13:10 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | A Note on Fast Algorithms of Shift Bound for Cyclic Codes Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2013-5 |
The shift bound is one of well-known and good bounds for the designed minimum distance in cyclic codes. However there is... [more] | IT2013-5 pp.19-22 |
| IT, ISEC, WBS | 2013-03-08 10:55 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | A Note on Linear Complexity for Constant-Weight Codes Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2012-90 ISEC2012-108 WBS2012-76 |
For cyclic codes (periodic sequences) over finite set from cyclic difference set proposed by authors, the Hamming weight... [more] | IT2012-90 ISEC2012-108 WBS2012-76 pp.175-179 |
| IT, ISEC, WBS | 2012-03-02 17:00 |
Kanagawa | A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2011-84 ISEC2011-111 WBS2011-85 |
We proposed a method for constructing constant-weight and multi-valued code from the cyclic difference sets by generaliz... [more] | IT2011-84 ISEC2011-111 WBS2011-85 pp.237-240 |
|
| IT | 2011-09-30 11:10 |
Tokyo | Tokyo Institute of Technology | Efficient Encoding for Quasi-Cyclic LDPC Codes with Rank Deficient Parity Check Matrices Haruka Obata, Hironori Uchikawa (Toshiba) IT2011-29 |
This paper presents an efficient encoding method for quasi-cyclic low-density parity-check (QC-LDPC) codes with rank def... [more] | IT2011-29 pp.35-40 |
| IT | 2011-05-20 15:25 |
Osaka | Osaka City University | A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes (Part 2) Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2011-7 |
The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. ... [more] |
IT2011-7 pp.37-40 |
| ISEC, IT, WBS | 2011-03-03 10:00 |
Osaka | Osaka University | A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyuhsu Women's Univ.) IT2010-78 ISEC2010-82 WBS2010-57 |
The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. ... [more] |
IT2010-78 ISEC2010-82 WBS2010-57 pp.65-68 |
| IT | 2010-05-21 14:35 |
Tokushima | the University of Tokushima | A Note on Bounds of Minimum Distance and Decoding Methods for Cyclic Codes by DFT Matrix Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2010-6 |
In this report, We give alternative proofs for the BCH boud, the Hertmann-Tzeng bound and the shift bound by the discre... [more] |
IT2010-6 pp.31-34 |
| IT, ISEC, WBS | 2010-03-05 11:15 |
Nagano | Nagano-Engineering Campus, Shinshu University | On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set Takayasu Kaida (Kinki Univ.) IT2009-135 ISEC2009-143 WBS2009-114 |
We propose a method for q-ary codes from the cyclic difference set by generalization of the method in binary case by N... [more] |
IT2009-135 ISEC2009-143 WBS2009-114 pp.409-412 |
[Return to Top Page]