Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
WBS, IT, ISEC |
2021-03-04 15:20 |
Online |
Online |
A Consideration on Evolving Secret Sharing Schemes using Linear Codes Hiroki Toriumi, Nozomi Miya, Hajime Jinushi (Aoyama Gakuin Univ.) IT2020-132 ISEC2020-62 WBS2020-51 |
Shamir's $(k, n)$ threshold scheme is realized by linear codes on a finite field. This scheme requires that an upper bou... [more] |
IT2020-132 ISEC2020-62 WBS2020-51 pp.123-127 |
EMM, IT |
2019-05-24 09:30 |
Hokkaido |
Asahikawa International Conference Hall |
A Consideration on Extended Ternary Memoryless Sources with a Simple Construction of Binary Compact Codes Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2019-7 EMM2019-7 |
The complexity of Huffman procedure grows with exponential order of $n$ for the $n$-th degree extended memoryless source... [more] |
IT2019-7 EMM2019-7 pp.31-36 |
SIP, IT, RCS |
2018-01-22 11:15 |
Kagawa |
Sunport Hall Takamatsu |
A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed
-- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2017-61 SIP2017-69 RCS2017-275 |
Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extende... [more] |
IT2017-61 SIP2017-69 RCS2017-275 pp.37-42 |
IT |
2013-07-25 15:30 |
Tokyo |
Nishi-Waseda campus, Waseda University |
A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2013-16 |
e consider regenerating codes. Regenerating codes are a class of codes for distributed storage systems that enable a dat... [more] |
IT2013-16 pp.27-32 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A consideration on minimum storage regenerating codes for functions Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2012-78 ISEC2012-96 WBS2012-64 |
We consider regenerating codes for functions. Regenerating codes are a class of codes for distributed storage systems th... [more] |
IT2012-78 ISEC2012-96 WBS2012-64 pp.107-112 |
IT |
2012-05-25 14:00 |
Fukuoka |
|
A consideration on characteristics of Huffman codes for binary memoryless sources Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.) IT2012-1 |
We consider characteristics of Huffman codes for extended binary memoryless sources. The construction of Huffman codes c... [more] |
IT2012-1 pp.1-6 |
ISEC, IT, WBS |
2011-03-04 13:50 |
Osaka |
Osaka University |
A consideration on unconditionally secure key distribution schemes considering leakage of secret information of key distribution centers Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2010-112 ISEC2010-116 WBS2010-91 |
A key distribution scheme (KDS) is a method of distributing secret keys in the network. In the conventional KDS, the sec... [more] |
IT2010-112 ISEC2010-116 WBS2010-91 pp.289-294 |
IT |
2011-01-18 11:40 |
Nara |
|
Lower bounds on the memory size of entities for a ramp key distribution scheme and an optimal construction Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2010-57 |
The security notion of conventional ramp key distribution scheme (KDS) is that fraudulent centers and users can get part... [more] |
IT2010-57 pp.19-24 |
IT |
2007-07-19 13:45 |
Hyogo |
Kobe Univ. |
Considerations of the method to construct a code with synchronizing codewords Sumikazu Ono, Hiroshi Okamoto, Hajime Jinushi (AGU) IT2007-9 |
There are Huffman equivalent codes which have same average codeword
length of Huffman codes. Some of these codes may co... [more] |
IT2007-9 pp.1-6 |