|
|
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 # |
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] |
2012-07-20 13:55 |
Hokkaido |
|
Rationality and Security in Oblivious Transfer Haruna Higo, Akihiro Yamada, Keisuke Tanaka (Tokyo Inst. of Tech.), Kenji Yasunaga (ISIT) ISEC2012-34 SITE2012-30 ICSS2012-36 EMM2012-26 |
[more] |
ISEC2012-34 SITE2012-30 ICSS2012-36 EMM2012-26 pp.181-188 |
IT |
2012-05-25 17:15 |
Fukuoka |
|
Rational Secret Sharing for Non-Simultaneous Channels Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Keisuke Tanaka (Tokyo Inst. of Tech.), Kenji Yasunaga (ISIT) IT2012-8 |
[more] |
IT2012-8 pp.41-46 |
COMP |
2010-12-03 13:00 |
Fukuoka |
Kyutech Plaza, Kyushu Institute of Technology |
Constant-round reconstruction for rational secret sharing Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (JAIST), Keisuke Tanaka, Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2010-41 |
[more] |
COMP2010-41 pp.15-21 |
COMP |
2010-12-03 13:35 |
Fukuoka |
Kyutech Plaza, Kyushu Institute of Technology |
On Randomness Leakage in Public-Key Encryption Hitoshi Namiki, Kenji Yasunaga, Keisuke Tanaka (Tokyo Inst. of Tech.) COMP2010-42 |
We consider the problem of constructing public-key encryption schemes that are resilient to leaking the randomness used ... [more] |
COMP2010-42 pp.23-28 |
COMP |
2009-03-02 13:00 |
Tokyo |
Tokyo Institute of Technology |
[Invited Talk]
Peformance analysis of error correcting codes Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2008-58 |
[more] |
COMP2008-58 p.33 |
IT |
2008-07-24 11:20 |
Chiba |
University of Tokyo, Kashiwa Campus |
On Distance Distribution of a Reed-Solomon-like Code for Network Coding Masafumi Tominaga (Osaka Univ.), Kenji Yasunaga (Kwansei Gakuin Univ.), Toru Fujiwara (Osaka Univ.) IT2008-9 |
Network coding is a technique for efficient network communication. Middle nodes between a source node and a destination ... [more] |
IT2008-9 pp.7-10 |
ISEC, IT, WBS |
2008-02-29 11:35 |
Tokyo |
|
A Lower Bound on the Number of Uncorrectable Errors of Weight Half the Minimum Distance Kenji Yasunaga, Toru Fujiwara (Osaka Univ.) IT2007-56 ISEC2007-153 WBS2007-87 |
[more] |
IT2007-56 ISEC2007-153 WBS2007-87 pp.51-56 |
IT |
2006-05-23 16:20 |
Nara |
Nara-ken new public hall |
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code Kenji Yasunaga, Toru Fujiwara (Osaka Univ.), Tadao Kasami (NAIST) |
Local weight distribution is the weight distribution of minimal codewords in linear codes. We give the local weight dist... [more] |
IT2006-6 pp.31-36 |
IT |
2005-05-26 13:50 |
Overseas |
Univ. of Hawaii |
The Local Weight Distributions of Transitive Invariant Codes and Their Punctured Codes Kenji Yasunaga, Toru Fujiwara (Osaka Univ.) |
The local weight distribution is the weight distribution of zero neighbors in a code. A zero neighbor is a codeword whos... [more] |
IT2005-14 pp.7-12 |
IT |
2004-07-29 09:55 |
Chiba |
Tokyo Univ. (Kashiwa) |
The local weight distributions of the (128,50) extended binary primitive BCH code and the (128,64) Reed-Muller code Kenji Yasunaga, Toru Fujiwara (Osaka Univ.) |
The local weight distribution of a block code gives some aspects of its error performance. We obtained the local weight ... [more] |
IT2004-19 pp.7-12 |
|
|
|
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]
|