default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikihiko Nishiara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Mikihiko Nishiara, Yuki Ito:
Proof of Achievability Part of Rate-Distortion Theorem without Random Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 404-408 (2024)- [j9]Masaki Hori, Mikihiko Nishiara:
Channel Capacity with Cost Constraint Allowing Cost Overrun. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 458-463 (2024) - 2022
- [j8]Mikihiko Nishiara:
Channel Coding with Cost Paid on Delivery. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 345-352 (2022) - [c6]Masaki Hori, Mikihiko Nishiara:
Channel Capacity with Cost Constraint Allowing Some Cost Overrun. ISITA 2022: 34-38 - 2021
- [j7]Riku Yamabe, Mikihiko Nishiara
, Osamu Takyu, Koichi Adachi:
Achievable Rate Enhancement Based on Multi-Packet Indexing in Packet-Level Index Modulation. IEEE Access 9: 154938-154946 (2021) - [c5]Riku Yamabe, Mikihiko Nishiara, Osamu Takyu:
Channel Capacity for a Model of Packet Level Index Modulation in LPWA Networks. ICUFN 2021: 339-344
2010 – 2019
- 2019
- [i1]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019) - 2017
- [j6]Mikihiko Nishiara, Ryo Hidai:
Decoding Error of Sudoku for Erasure Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2641-2646 (2017) - 2016
- [c4]Mikihiko Nishiara, Ryo Hidai:
Decoding error of Sudoku for erasure channels. ISITA 2016: 61-65 - 2011
- [c3]Mikihiko Nishiara:
Achievability of maximum decoding rate on sequential coding. ITW 2011: 472-475 - 2010
- [c2]Mikihiko Nishiara:
On coding for source with infinitesimal time slots. ISITA 2010: 78-81
2000 – 2009
- 2007
- [c1]Mikihiko Nishiara:
Study on Coding for Continuous-Time Markov Chains on Real-Time Basis. ISIT 2007: 2896-2899 - 2006
- [j5]I Gusti Bagus Baskara Nugraha, Sumiya Marugami, Mikihiko Nishiara, Hiroyoshi Morita:
Multicast Communication for Video Broadcasting Service over IPv4 Network Using IP Option. IEICE Trans. Commun. 89-B(5): 1570-1580 (2006) - [j4]Mikihiko Nishiara:
Coding for Sources That Output Symbols According to Poisson Process. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2906-2913 (2006) - [j3]Yu Qiao, Mikihiko Nishiara, Makoto Yasuhara:
A Framework Toward Restoration of Writing Order from Single-Stroked Handwriting Image. IEEE Trans. Pattern Anal. Mach. Intell. 28(11): 1724-1737 (2006) - 2005
- [j2]Dongzhao Sun, Mikihiko Nishiara, Hiroyoshi Morita:
On Multiple Smoothed Transmission of MPEG Video Streams. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2844-2851 (2005) - 2000
- [j1]Mikihiko Nishiara, Hiroyoshi Morita:
On the AEP of word-valued sources. IEEE Trans. Inf. Theory 46(3): 1116-1120 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
