default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Muramatsu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c38]Jun Muramatsu:
Distributed Source Coding Using Constrained-Random-Number Generators. ISIT 2024: 1676-1681- [c37]Jun Muramatsu:
A Simple Proof of Multi-Letter Converse Theorem for Distributed Lossless Source Coding. ISITA 2024: 349-353 - [i18]Jun Muramatsu
:
Distributed Source Coding Using Constrained-Random-Number Generators. CoRR abs/2401.13232 (2024) - [i17]Jun Muramatsu:
Distributed Source Coding, Multiple Description Coding, and Source Coding with Side Information at Decoders Using Constrained-Random Number Generators. CoRR abs/2410.07939 (2024) - 2023
- [c36]Jun Muramatsu:
Channel Codes for Relayless Networks with General Message Access Structure. ITW 2023: 521-525 - 2022
- [c35]Jun Muramatsu:
Binary Polar Codes Based on Bit Error Probability. ISIT 2022: 2148-2153 - [c34]Jun Muramatsu:
On the Achievability of Interference Channel Coding. ISITA 2022: 39-43 - [i16]Jun Muramatsu:
On the Achievability of Interference Channel Coding. CoRR abs/2201.10756 (2022) - [i15]Jun Muramatsu:
Channel Codes for Relayless Networks with General Message Access Structure. CoRR abs/2206.00792 (2022) - 2021
- [c33]Jun Muramatsu:
Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization. ISIT 2021: 2364-2368 - [i14]Jun Muramatsu:
Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization. CoRR abs/2101.08433 (2021) - [i13]Jun Muramatsu:
Binary Polar Codes Based on Bit Error Probability. CoRR abs/2101.08943 (2021)
2010 – 2019
- 2019
- [j25]Shigeki Miyake, Jun Muramatsu, Takahiro Yamaguchi:
Decoding via Sampling. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(11): 1512-1523 (2019) - [j24]Jun Muramatsu, Shigeki Miyake:
Channel Code Using Constrained-Random-Number Generator Revisited. IEEE Trans. Inf. Theory 65(1): 500-510 (2019) - [c32]Jun Muramatsu, Shigeki Miyake:
Stochastic Decision with Stationary Memoryless Sequence. ISIT 2019: 902-906 - [c31]Jun Muramatsu:
Successive-Cancellation Decoding of Linear Source Code. ITW 2019: 1-5 - [i12]Jun Muramatsu:
Successive-Cancellation Decoding of Linear Source Code. CoRR abs/1903.11787 (2019) - [i11]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
- [c30]Jun Muramatsu, Shigeki Miyake:
Multi-Terminal Codes Using Constrained-Random-Number Generators. ISITA 2018: 580-584 - [c29]Kazunori Fujimoto, Jun Muramatsu, Masaaki Nagahara:
Dynamical Model of Overconfidence Phenomena Due to ZE-Type Confirmation Bias. SMC 2018: 2212-2217 - [i10]Jun Muramatsu, Shigeki Miyake:
Multi-Terminal Codes Using Constrained-Random-Number Generators. CoRR abs/1801.02875 (2018) - 2017
- [j23]Jun Muramatsu, Hiroki Koga:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2556-2557 (2017) - [c28]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 - [i9]Jun Muramatsu, Shigeki Miyake:
On the error probability of stochastic decision and stochastic decoding. CoRR abs/1701.04950 (2017) - [i8]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
- [c27]Jun Muramatsu, Shigeki Miyake:
Construction of a channel code from an arbitrary source code with decoder side information. ISITA 2016: 176-180 - [c26]Jun Muramatsu, Shigeki Miyake:
Fundamental limits are achievable with countable alphabet. ISITA 2016: 542-546 - [c25]Kazunori Fujimoto, Jun Muramatsu:
Active Bayesian observer correcting overconfidence effects due to E-type confirmatory bias. SMC 2016: 1443-1448 - [i7]Jun Muramatsu:
Construction of a Channel Code from an Arbitrary Source Code with Decoder Side Information. CoRR abs/1601.05879 (2016) - 2015
- [j22]Jun Muramatsu, Kazuyuki Yoshimura, Peter Davis, Atsushi Uchida, Takahisa Harayama:
Secret-Key Distribution Based on Bounded Observability. Proc. IEEE 103(10): 1762-1780 (2015) - [j21]Jun Muramatsu:
Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator. IEEE Trans. Inf. Theory 61(6): 3574-3592 (2015) - [c24]Jun Muramatsu:
Variable-Length Lossy Compression Algorithms Based on Constrained Random Numbers. DCC 2015: 463 - [c23]Shigeki Miyake, Jun Muramatsu:
Index coding over correlated sources. NetCod 2015: 36-40 - 2014
- [j20]Jun Muramatsu:
Channel Coding and Lossy Source Coding Using a Generator of Constrained Random Numbers. IEEE Trans. Inf. Theory 60(5): 2667-2686 (2014) - [c22]Jun Muramatsu:
General formula for secrecy capacity of wiretap channel with noncausal state. ISIT 2014: 21-25 - [c21]Jun Muramatsu:
Formulas for limit superior/inferior in probability. ISITA 2014: 115-119 - [c20]Jun Muramatsu:
Variable-length lossy source code using a constrained-random-number generator. ITW 2014: 197-201 - 2013
- [j19]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) - [c19]Jun Muramatsu:
Lossy source code using a constrained random number generator. ISIT 2013: 2354-2358 - [c18]Jun Muramatsu:
Channel code using a constrained Random number generator. ISIT 2013: 2463-2467 - [c17]Jun Muramatsu:
Equivalence of inner regions for broadcast channel coding. ITW 2013: 1-5 - [i6]Jun Muramatsu:
Channel Coding and Lossy Source Coding Using a Constrained Random Number Generator. CoRR abs/1302.0951 (2013) - 2012
- [j18]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) - [j17]Jun Muramatsu, Shigeki Miyake:
Corrections to "Hash Property and Fixed-Rate Universal Coding Theorems". IEEE Trans. Inf. Theory 58(5): 3305-3307 (2012) - [c16]Shigeki Miyake, Jun Muramatsu:
On a construction of universal network code using LDPC matrices. ISIT 2012: 1301-1305 - [c15]Shigeki Miyake, Jun Muramatsu:
Universal codes on continuous alphabet using sparse matrices. ISITA 2012: 493-497 - [c14]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
- [c13]Jun Muramatsu, Shigeki Miyake:
Construction of strongly secure wiretap channel code based on hash property. ISIT 2011: 613-617 - [c12]Jun Muramatsu, Shigeki Miyake:
Construction of multiple access channel codes based on hash property. ISIT 2011: 2263-2267 - 2010
- [j16]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) - [j15]Jun Muramatsu, Shigeki Miyake:
Hash property and fixed-rate universal coding theorems. IEEE Trans. Inf. Theory 56(6): 2688-2698 (2010) - [j14]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) - [c11]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
- [j13]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) - [c10]Jun Muramatsu, Kazuyuki Yoshimura, Peter Davis:
Information Theoretic Security Based on Bounded Observability. ICITS 2009: 128-139 - [c9]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
- [j12]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) - [j11]Jun Muramatsu:
Effect of Random Permutation of Symbols in a Sequence. IEEE Trans. Inf. Theory 54(1): 78-86 (2008) - [c8]Jun Muramatsu, Shigeki Miyake:
Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding. ISIT 2008: 424-428 - [c7]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
- [c6]Shigeki Miyake, Jun Muramatsu:
Construction of a Lossy Source Code Using LDPC Matrices. ISIT 2007: 1106-1110 - [c5]Jun Muramatsu:
Effect of Random Permutation of Symbols in a Sequence. ISIT 2007: 1486-1490 - 2006
- [j10]Jun Muramatsu:
Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(7): 2036-2046 (2006) - [j9]Jun Muramatsu, Kazuyuki Yoshimura, Peter Davis:
Secret Key Capacity and Advantage Distillation Capacity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2589-2596 (2006) - [j8]Jun Muramatsu, Kazuyuki Yoshimura, Kenichi Arai, Peter Davis:
Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack. IEEE Trans. Inf. Theory 52(11): 5140-5151 (2006) - [c4]Jun Muramatsu, Kazuyuki Yoshimura, Peter Davis:
Secret Key Capacity and Advantage Distillation Capacity. ISIT 2006: 2598-2602 - 2005
- [j7]Jun Muramatsu:
Source Coding Algorithms Using the Randomness of a Past Sequence. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 1063-1083 (2005) - [j6]Jun Muramatsu, Takafumi Mukouchi:
Simulated Random Coding Algorithm for Correlated Sources with Ensemble of Linear Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(9): 2475-2480 (2005) - [j5]Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama:
Low-density parity-check matrices for coding of correlated sources. IEEE Trans. Inf. Theory 51(10): 3645-3654 (2005) - [c3]Jun Muramatsu, Kazuyuki Yoshimura, Kenichi Arai, Peter Davis:
Secret key agreement under sampling attack. ISIT 2005: 2147-2151 - 2004
- [c2]Jun Muramatsu:
Secret key agreement from correlated source outputs using LDPC matrices. ISIT 2004: 15 - 2003
- [j4]Jun Muramatsu, Hiroki Koga, Takafumi Mukouchi:
On the Problem of Generating Mutually Independent Random Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1275-1284 (2003) - [c1]Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama:
Low density parity check matrices for coding of multiple access networks. ITW 2003: 304-307 - 2002
- [j3]Ken-ichi Iwata, Jun Muramatsu:
An Information-Spectrum Approach to Rate-Distortion Function with Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(6): 1387-1395 (2002) - [j2]Jun Muramatsu:
On the performance of recency-rank and block-sorting universal lossless data compression algorithms. IEEE Trans. Inf. Theory 48(9): 2621-2625 (2002)
1990 – 1999
- 1999
- [j1]Jun Muramatsu, Fumio Kanaya:
Almost-Sure Variable-Length Source Coding Theorems for General Sources. IEEE Trans. Inf. Theory 45(1): 337-342 (1999)
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 2025-03-11 20:04 CET 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:
