Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS, SR, NS, SeMI, RCC (Joint) |
2021-07-16 10:30 |
Online |
Online |
Channel capacity for a model of Packet level Index Modulation considering Erasure probability Riku Yamabe, Mikihiko Nishiara, Osamu Takyu (Shinshu Univ) SR2021-33 |
Packet level index modulation is a modulation scheme that can expand the transmission capacity without changing the exis... [more] |
SR2021-33 pp.61-66 |
SIP, IT, RCS |
2021-01-21 11:20 |
Online |
Online |
The Rate-Delay Function for Binary i.i.d. Sources Terumichi Ohashi, Mikihiko Nishiara (Shinshu Univ.) IT2020-74 SIP2020-52 RCS2020-165 |
The low delay communication is important, while reducing the coding rate is also needed owing to a cost. So we have to i... [more] |
IT2020-74 SIP2020-52 RCS2020-165 pp.64-68 |
SIP, IT, RCS |
2021-01-21 13:35 |
Online |
Online |
Channel Coding Theorem with Asymptotic Cost Constraint Allowing Decoding Error and Cost Overrun Masaki Hori, Mikihiko Nishiara (Shinshu Univ.) IT2020-83 SIP2020-61 RCS2020-174 |
We consider a problem where the cost is defined over the coding alphabet in the channel coding problem.
Such a proble... [more] |
IT2020-83 SIP2020-61 RCS2020-174 pp.107-112 |
SIP, IT, RCS |
2021-01-21 14:00 |
Online |
Online |
Channel capacity for a model of Packet level Index Modulation in LPWA Networks Riku Yamabe, Mikihiko Nishiara, Osamu Takyu (Shinshu Univ.) IT2020-84 SIP2020-62 RCS2020-175 |
Packet level Index Modulation is a modulation method that can expand the transmission capacity without changing the exis... [more] |
IT2020-84 SIP2020-62 RCS2020-175 pp.113-118 |
IT |
2019-07-25 15:25 |
Tokyo |
NATULUCK-Iidabashi-Higashiguchi Ekimaeten |
A Fundamental Consideration on Rate-Delay Theory Terumichi Ohashi, Mikihiko Nishiara (Shinshu Univ.) IT2019-18 |
The low delay communication is important, while reducing the coding rate is also needed owing to a cost. So we want to i... [more] |
IT2019-18 pp.17-21 |
IT |
2018-09-05 10:35 |
Iwate |
Seionsou |
On searching for optimal non-alphabetic arithmetic codes based on A* algorithm Naohiro Uchida, Mikihiko Nishiara (Shinshu Univ.) IT2018-30 |
Arithmetic codes are known as alphabetic codes.In this report, we expand alphabetic arithmetic codes into non-alphabetic... [more] |
IT2018-30 pp.19-23 |
IT |
2017-09-08 11:15 |
Yamaguchi |
Centcore Yamaguchi Hotel |
A Strongly Secure Secret Sharing Scheme with Ramp Threshold Forms a Maximum Distance Separable Code Mikihiko Nishiara (Shinshu Univ.) IT2017-43 |
It is known that ideal secret sharing schemes can be constructed from MDS (maximum distance separable) codes on a finite... [more] |
IT2017-43 pp.27-30 |
IT |
2017-07-14 11:15 |
Chiba |
Chiba University |
A Breadth-First Search Algorithm for Constructing Optimal Binary AIFV Codes Masashi Yamakawa, Mikihiko Nishiara (Shinshu Univ.) IT2017-30 |
[more] |
IT2017-30 pp.79-83 |
ISEC, IT, WBS |
2014-03-10 10:10 |
Aichi |
Nagoya Univ., Higashiyama Campus |
Decoding error of Sudoku for erasure channel Ryo Hidai, Mikihiko Nishiara (Shinshu Univ.) IT2013-54 ISEC2013-83 WBS2013-43 |
Sudoku is a pencil puzzle.
The aim of the solver is to complete the $9 times 9$ grid by filling in a digit in every bo... [more] |
IT2013-54 ISEC2013-83 WBS2013-43 pp.1-6 |
IT |
2011-05-20 13:55 |
Osaka |
Osaka City University |
Access Structure of Secret Sharing Scheme based on Second-Degree Bivariate Polynomial Interpolation Scheme Hideaki Kashiwagura, Mikihiko Nishiara (Shinshu Univ.) IT2011-4 |
Shamir's polynomial interpolation scheme is a secret sharing scheme
with univariate polynomial.
In this study, we inve... [more] |
IT2011-4 pp.19-24 |
ISEC, IT, WBS |
2011-03-03 11:15 |
Osaka |
Osaka University |
Algorithm for Minimizing Distortion in Delay-Sensitive Transmission on Closed-Loop System Yuto Iwai, Mikihiko Nishiara (Shinshu Univ.) IT2010-81 ISEC2010-85 WBS2010-60 |
In order to carry out the streaming,in which video data is downloaded and played simultaneously, every frame needs to be... [more] |
IT2010-81 ISEC2010-85 WBS2010-60 pp.81-86 |
IT, ISEC, WBS |
2010-03-05 15:20 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
On Access Structures of Secret Sharing Scheme based on Bivariate Polynomial Interpolation Scheme Hideaki Kashiwagura, Mikihiko Nishiara (Shinshu Univ) IT2009-141 ISEC2009-149 WBS2009-120 |
Shamir’s polynomial interpolation scheme is a secret sharing scheme with univariate polynomial.
In this study, we inve... [more] |
IT2009-141 ISEC2009-149 WBS2009-120 pp.445-448 |
IT |
2009-07-24 15:15 |
Osaka |
Kwansei Gakuin Univ. (Umeda campus) |
Strongly Secure Secret Sharing Scheme with Ramp Threshold based on Shamir's Polynomial Interpolation Scheme Mikihiko Nishiara (Shinshu Univ.), Katsunori Takizawa (Suzuki) IT2009-27 |
A construction method for secret sharing scheme with ramp threshold based on extended scheme of Shamir's polynomial inte... [more] |
IT2009-27 pp.127-129 |
IT |
2008-07-25 10:50 |
Chiba |
University of Tokyo, Kashiwa Campus |
Delay of Symbols Obeying Poisson Arrival on Communication System by Arithmetic Code Mikihiko Nishiara (Shinshu Univ.), Tatsunori Sugihara (Toyoda Gosei) IT2008-18 |
We consider the delay of symbols that are obtained
from an i.i.d.\ source with the timing of Poisson arrival.
The code... [more] |
IT2008-18 pp.13-16 |
CAS, NLP |
2007-10-18 10:30 |
Tokyo |
Musashi Institute of Technology |
Branch Prediction Based on Antidictionary Tree Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PIT-Nagano) CAS2007-38 NLP2007-66 |
It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speed-up of mic... [more] |
CAS2007-38 NLP2007-66 pp.21-24 |
WBS, IT, ISEC |
2006-03-16 09:45 |
Aichi |
Nagoya Univ. |
On Construction of Reversible Variable-Length Codes Including Synchronization Markers as Codewords Dongzhao Sun, Hiroyoshi Morita, Mikihiko Nishiara (Univ. of Electro-Comm.) |
[more] |
IT2005-88 ISEC2005-145 WBS2005-102 pp.141-146 |
WBS, IT, ISEC |
2006-03-16 10:45 |
Aichi |
Nagoya Univ. |
On stochastic model for generating process of codewords of arithmetic code Dai Watanabe, Mikihiko Nishiara, Hiroyoshi Morita (UEC) |
Using the arithmetic code, a prefix of codeword can be determined from
a prefix of source sequence.
In this report, we... [more] |
IT2005-90 ISEC2005-147 WBS2005-104 pp.153-158 |
NS, PN (Joint) |
2005-12-15 15:25 |
Ehime |
|
[Encouragement Talk]
Hybrid Protocol for Live Video Streaming I Gusti Bagus Baskara Nugraha, Mikihiko Nishiara, Hiroyoshi Morita (Univ. of Electro-Comm.) |
A combination of Multicast Datagram Transfer Protocol (MDTP) and overlay multicast system for live video streaming servi... [more] |
NS2005-140 pp.29-32 |
NS |
2005-06-24 13:40 |
Fukuoka |
Production and Systems, Waseda Univ.(Kitakyusyu) |
A Prototype of Internet Video Broadcasting Using Unicast Protocol I Gusti Bagus Baskara Nugraha, Mikihiko Nishiara, Hiroyoshi Morita (Univ. of Electro-Comm.) |
In this paper, an Internet video broadcasting or video webcast system by using Multicast Datagram Transfer Protocol (MDT... [more] |
NS2005-55 pp.69-72 |