|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2015-09-04 09:00 |
Ishikawa |
Hakusan Shobutei |
Linear Programming Decoding of Binary Linear Codes over Symbol-Pair Read Channels Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.) IT2015-34 |
In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels.
Symbol-pair ... [more] |
IT2015-34 pp.1-6 |
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 |
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 |
WBS, IT, ISEC |
2009-03-10 15:15 |
Hokkaido |
Hakodate Mirai Univ. |
An Efficient Method for Evaluating Max-Fractional Distance Based on A Primal Path-Following Interior Point Method Makoto Miwa, Tadashi Wadayama, Ichi Takumi (Nagoya Inst. of Tech.) IT2008-108 ISEC2008-166 WBS2008-121 |
The max-fractional distance of a binary linear code is deeply related to
the performance of an linear programming (LP)... [more] |
IT2008-108 ISEC2008-166 WBS2008-121 pp.427-433 |
IT |
2008-07-24 15:15 |
Chiba |
University of Tokyo, Kashiwa Campus |
Source Coding with LDPC code using Linear Programming Junya Honda (Univ. of Tokyo), Shigeki Miyake (NTT), Hirosuke Yamamoto (Univ. of Tokyo), Mitsuru Maruyama (NTT) IT2008-13 |
In channel coding, Feldman showed that linear programming can be used instead of the sum-product algorithm in the decodi... [more] |
IT2008-13 pp.27-32 |
IT |
2008-05-16 14:50 |
Wakayama |
Wakayama University |
A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance Makoto Miwa, Tadashi Wadayama, Ichi Takumi (Nagoya Inst. of Tech.) IT2008-3 |
In this paper, an idea of the cutting plane method is employed
to improve the fractional distance of a given binary p... [more] |
IT2008-3 pp.11-16 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|