| 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 | 2013-09-27 09:50 |
Okinawa | Culture Resort Festone (Okinawa) | A Soft-Decision Sphere Decoding Based on a Recursive Vector Generator Using Euclidian Distance Takuya Kusaka (Okayama Univ.), Toru Fujiwara (Osaka Univ.), Ryuhei Yokoyama (Okayama Univ.)  IT2013-33 |
A soft-decision sphere decoding algorithm for general binary linear codes is proposed. The algorithm is based on a modif... [more] | IT2013-33 pp.7-11 |
| IT | 2013-07-25 16:20 |
Tokyo | Nishi-Waseda campus, Waseda University | Gilbert-Varshamov-type Bound for Relative Dimension Length Profile Ryutaroh Matsumoto (Tokyo Inst. of Tech.) IT2013-18 |
We propose a Gilbert-Varshamov-type existential bound for the relative dimension length profile and the relative gener... [more] |
IT2013-18 pp.39-40 |
| 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 | 2012-09-27 15:25 |
Gunma | Kusatsu Seminar House | Efficient Termination of Spatially-Coupled Codes Koji Tazoe, Kenta Kasai, Kohichi Sakaniwa (Tokyo Tech) IT2012-32 |
It has been reported that spatially-coupled Hsu-Anatasopoulos (SC-HA) codes have the bounded max-imum degree and approac... [more] | IT2012-32 pp.7-12 |
| IT | 2012-09-28 11:05 |
Gunma | Kusatsu Seminar House | Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.) IT2012-40 |
In this paper, we develop a dual decomposition method based linear-programming (LP) decoding for multiple-access channel... [more] | IT2012-40 pp.53-58 |
| IT | 2012-07-20 10:20 |
Aichi | Toyota Technological Institute | Construction of Good Linear Block Codes with Puncturing Motoyuki Watanabe, Junichi Tsurumi, Masakatu Morii (Kobe Univ.) IT2012-19 |
Minimum distance is an important parameter to determine the performance of error correcting codes. It is important for ... [more] |
IT2012-19 pp.61-66 |
| IT | 2012-07-20 14:20 |
Aichi | Toyota Technological Institute | Linear time termination of systematic spatially-coupled codes Koji Tazoe, Kenta Kasai, Kohichi Sakaniwa (Tokyo Tech) IT2012-24 |
Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and ... [more] | IT2012-24 pp.91-96 |
| IT, ISEC, WBS | 2012-03-01 17:00 |
Kanagawa | Error Exponents of Linear Codes for Slepian-Wolf Source Coding Tomohiko Uyematsu (Tokyo Inst. Tech.) IT2011-55 ISEC2011-82 WBS2011-56 |
The Slepian-Wolf coding problem is one of the most fundamental problems in the area of multiterminal source coding. In ... [more] |
IT2011-55 ISEC2011-82 WBS2011-56 pp.61-66 |
|
| 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 | 2012-01-20 14:05 |
Ibaraki | University of Tsukuba | A note on novel permutation codes based on pure involution codes Kazuhiro Fuwa, Tadashi Wadayama (NIT) IT2011-39 |
In this paper, we propose a novel class of permutation codes based on pure involution codes. Pure involution code is a ... [more] |
IT2011-39 pp.1-6 |
| COMP | 2011-12-16 10:00 |
Aichi | Nagoya Univ. | Relationship Between Coding Theory and Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (NITech) COMP2011-37 |
Counting perfect matchings is known as one of the hard problems to obtain exact results, which is proven to be \#P-comp... [more] |
COMP2011-37 pp.9-15 |
| SWIM | 2011-11-18 10:30 |
Tokyo | Tokai Univ.(Takanawa) | An Integrated Design and Verification Environment from Upstream Design to Model Checking Process
-- Automatic Conversion from UML Descriptions into the Process Definitions and Linear Temporal Logic for SPIN Model Checker -- Naoki Miyamoto, Katsumi Wasaki (Shinshu Univ) SWIM2011-19 |
To execute a SPIN model checker, the targeted model has to be described by the dedicated specification description langu... [more] | SWIM2011-19 pp.7-12 |
| RCS, SAT (Joint) |
2011-08-25 11:00 |
Niigata | Niigata Univ. | [Requested Talk] Efficient Encoding for LDPC codes Tomoharu Shibuya (Sophia Univ) SAT2011-20 RCS2011-115 |
It is well known that LDPC codes can exhibit excellent performance by iterative decoding with O(n) computational comple... [more] |
SAT2011-20 RCS2011-115 pp.21-26 |
| IT | 2011-01-18 14:50 |
Nara | A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.), Shigeichi Hirasawa (Waseda Univ./Cyber Univ.) IT2010-63 |
Probabilistic inference problem on the graphical model is very important since it is arising in many applications which ... [more] | IT2010-63 pp.55-60 |
|
| IT | 2010-09-21 16:50 |
Miyagi | Tohoku Gakuin University | Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.) IT2010-39 |
In this paper, we develop a linear-programming (LP) decoding for the multiple-access channel with binary linear codes. ... [more] |
IT2010-39 pp.31-36 |
| IT | 2010-09-21 17:15 |
Miyagi | Tohoku Gakuin University | An Improvement of Adaptive Cutting Plane Method for Linear Programming Decoding of Binary Linear Codes Jun Muramatsu (NTT) IT2010-40 |
An maximum-likelihood decoding algorithm for a linear code is introduced. It is based on the linear programming method i... [more] | IT2010-40 pp.37-42 |
| IT | 2010-09-22 13:30 |
Miyagi | Tohoku Gakuin University | Encoding of Linear Codes Based on the Rearrangement of Block-Triangularized Parity-Check Matrices Tomoharu Shibuya (Sophia Univ.) IT2010-45 |
Efficient algorithms to solve a system of linear equations have been extensively and deeply investigated in a large numb... [more] | IT2010-45 pp.69-74 |
| IT | 2010-07-22 16:40 |
Tokyo | Kogakuin University | [Invited Talk]
On Costruction Methods of Lee-Metric Error Correcting Codes over Finite Rings Katsuhiro Nakamura (Chiba Univ.) IT2010-22 |
This paper describes Lee-metric error correcting codes over finite rings，especially over integer residue ring Zq (q=2^m)... [more] | IT2010-22 pp.63-66 |
| ISEC | 2010-05-21 16:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | New Class of Public Key Cryptosystems Constructed Based on Error-Correcting Codes, Using K(III) Scheme
-- Appendix: Proposal of K(IX)SE(g)PKC -- Masao Kasahara (Osaka Gakuin Univ.) ISEC2010-7 |
In this paper, we present a new scheme referred to as K(?) scheme which would be very effective for improving a certain ... [more] | ISEC2010-7 pp.41-48 |
| IT, ISEC, WBS | 2010-03-04 11:15 |
Nagano | Nagano-Engineering Campus, Shinshu University | On the Size of Circulant Matrices for which Reversible Codes Exist Tomoharu Shibuya, Keita Nakade (Sophia Univ.) IT2009-94 ISEC2009-102 WBS2009-73 |
Recently, Haley and Grant introduced the concept of reversible codes - a class of linear codes encodable by the iterat... [more] |
IT2009-94 ISEC2009-102 WBS2009-73 pp.147-151 |
[Return to Top Page]