default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShigeki Miyake
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Shigeki Miyake, Jun Muramatsu
, Takahiro Yamaguchi:
Decoding via Sampling. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(11): 1512-1523 (2019)- [j13]Jun Muramatsu, Shigeki Miyake:
Channel Code Using Constrained-Random-Number Generator Revisited. IEEE Trans. Inf. Theory 65(1): 500-510 (2019) - [c17]Jun Muramatsu, Shigeki Miyake:
Stochastic Decision with Stationary Memoryless Sequence. ISIT 2019: 902-906 - [i9]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) - 2018
- [c16]Jun Muramatsu, Shigeki Miyake:
Multi-Terminal Codes Using Constrained-Random-Number Generators. ISITA 2018: 580-584 - [i8]Jun Muramatsu, Shigeki Miyake:
Multi-Terminal Codes Using Constrained-Random-Number Generators. CoRR abs/1801.02875 (2018) - 2017
- [c15]Jun Muramatsu, Shigeki Miyake:
On the error probability of stochastic decision and stochastic decoding. ISIT 2017: 1643-1647 - [p1]Jun Muramatsu, Shigeki Miyake:
Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices. CREST Crypto-Math Project 2017: 177-198 - [i7]Jun Muramatsu, Shigeki Miyake:
On the error probability of stochastic decision and stochastic decoding. CoRR abs/1701.04950 (2017) - [i6]Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane, Yanling Chen, Peter H. N. de With, Héla Gassara, Hamed Gharbi, Adel Ghazel, Khaled Grati, Naira M. Grigoryan, Ashot N. Harutyunyan, Masayuki Imanishi, Mitsugu Iwamoto, Ken-ichi Iwata, Hiroshi Kamabe, Brian M. Kurkoski, Shigeaki Kuzuoka, Patrick Langenhuizen, Jan Lewandowsky, Akiko Manada, Shigeki Miyake, Hiroyoshi Morita, Jun Muramatsu, Safa Najjar, Arnak V. Poghosyan, Fatma Rouissi, Yuta Sakai, Ulrich Tamm, Joost van der Putten, Fons van der Sommen, A. J. Han Vinck, Tadashi Wadayama, Dirk Wübben, Hirosuke Yamamoto:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2016
- [c14]Jun Muramatsu, Shigeki Miyake:
Construction of a channel code from an arbitrary source code with decoder side information. ISITA 2016: 176-180 - [c13]Jun Muramatsu, Shigeki Miyake:
Fundamental limits are achievable with countable alphabet. ISITA 2016: 542-546 - 2015
- [c12]Shigeki Miyake, Jun Muramatsu:
Index coding over correlated sources. NetCod 2015: 36-40 - 2013
- [j12]Jun Muramatsu, Shigeki Miyake:
Corrections to "Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding". IEEE Trans. Inf. Theory 59(10): 6952-6953 (2013) - 2012
- [j11]Jun Muramatsu, Shigeki Miyake:
Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property. IEEE Trans. Inf. Theory 58(2): 671-692 (2012) - [j10]Jun Muramatsu, Shigeki Miyake:
Corrections to "Hash Property and Fixed-Rate Universal Coding Theorems". IEEE Trans. Inf. Theory 58(5): 3305-3307 (2012) - [c11]Shigeki Miyake, Jun Muramatsu:
On a construction of universal network code using LDPC matrices. ISIT 2012: 1301-1305 - [c10]Shigeki Miyake, Jun Muramatsu:
Universal codes on continuous alphabet using sparse matrices. ISITA 2012: 493-497 - [c9]Jun Muramatsu, Shigeki Miyake:
Uniform random number generation by using sparse matrix. ITW 2012: 607-611 - [i5]Jun Muramatsu, Shigeki Miyake:
Construction of Multiple Access Channel Codes Based on Hash Property. CoRR abs/1210.6719 (2012) - 2011
- [c8]Jun Muramatsu, Shigeki Miyake:
Construction of strongly secure wiretap channel code based on hash property. ISIT 2011: 613-617 - [c7]Jun Muramatsu, Shigeki Miyake:
Construction of multiple access channel codes based on hash property. ISIT 2011: 2263-2267 - 2010
- [j9]Jun Muramatsu, Shigeki Miyake:
Hash property and coding theorems for sparse matrices and maximum-likelihood coding. IEEE Trans. Inf. Theory 56(5): 2143-2167 (2010) - [j8]Jun Muramatsu, Shigeki Miyake:
Hash property and fixed-rate universal coding theorems. IEEE Trans. Inf. Theory 56(6): 2688-2698 (2010) - [j7]Jun Muramatsu, Shigeki Miyake:
Corrections to "hash property and coding theorems for sparse matrices and maximum-likelihood coding". IEEE Trans. Inf. Theory 56(9): 4762 (2010) - [c6]Jun Muramatsu, Shigeki Miyake:
Construction of broadcast channel code based on hash property. ISIT 2010: 575-579 - [i4]Jun Muramatsu, Shigeki Miyake:
Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property. CoRR abs/1006.5271 (2010)
2000 – 2009
- 2009
- [j6]Shigeki Miyake, Jun Muramatsu:
A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(9): 2333-2344 (2009) - [c5]Jun Muramatsu, Shigeki Miyake:
Coding theorem for general stationary memoryless channel based on hash property. ISIT 2009: 541-545 - [i3]Jun Muramatsu, Shigeki Miyake:
Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices. CoRR abs/0903.4014 (2009) - 2008
- [j5]Shigeki Miyake, Jun Muramatsu:
A Construction of Lossy Source Code Using LDPC Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(6): 1488-1501 (2008) - [c4]Jun Muramatsu, Shigeki Miyake:
Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding. ISIT 2008: 424-428 - [c3]Shigeki Miyake, Jun Muramatsu:
A construction of channel code, joint source-channel code, and universal code for arbitrary stationary memoryless channels using sparse matrices. ISIT 2008: 1193-1197 - [i2]Jun Muramatsu, Shigeki Miyake:
Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding. CoRR abs/0801.3878 (2008) - [i1]Jun Muramatsu, Shigeki Miyake:
Hash Property and Fixed-rate Universal Coding Theorems. CoRR abs/0804.1183 (2008) - 2007
- [j4]Shigeki Miyake, Mitsuru Maruyama:
Construction of Universal Codes Using LDPC Matrices and Their Error Exponents. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1830-1839 (2007) - [c2]Shigeki Miyake, Jun Muramatsu:
Construction of a Lossy Source Code Using LDPC Matrices. ISIT 2007: 1106-1110 - 2006
- [c1]Shigeki Miyake:
Lossy Data Compression over Zq by LDPC Code. ISIT 2006: 813-816
1990 – 1999
- 1992
- [j3]Etienne Barnard, Fumio Kanaya, Shigeki Miyake:
Comments on 'Bayes statistical behavior and valid generalization of pattern classifying neural networks' [with reply]. IEEE Trans. Neural Networks 3(6): 1026-1027 (1992) - 1991
- [j2]Fumio Kanaya, Shigeki Miyake:
Bayes statistical behavior and valid generalization of pattern classifying neural networks. IEEE Trans. Neural Networks 2(4): 471-475 (1991) - [j1]Shigeki Miyake, Fumio Kanaya:
A neural network approach to a Bayesian statistical decision problem. IEEE Trans. Neural Networks 2(5): 538-540 (1991)
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-08-05 20:19 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:
