Jun Muramatsu

Orcid: 0000-0001-5016-5717

According to our database1, Jun Muramatsu authored at least 63 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Distributed Source Coding Using Constrained-Random-Number Generators.
CoRR, 2024

2023
Channel Codes for Relayless Networks with General Message Access Structure.
Proceedings of the IEEE Information Theory Workshop, 2023

2022
On the Achievability of Interference Channel Coding.
CoRR, 2022

Binary Polar Codes Based on Bit Error Probability.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2019
Channel Code Using Constrained-Random-Number Generator Revisited.
IEEE Trans. Inf. Theory, 2019

Decoding via Sampling.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.
CoRR, 2019

Successive-Cancellation Decoding of Linear Source Code.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Stochastic Decision with Stationary Memoryless Sequence.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Dynamical Model of Overconfidence Phenomena Due to ZE-Type Confirmation Bias.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

Multi-Terminal Codes Using Constrained-Random-Number Generators.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Proceedings of Workshop AEW10: Concepts in Information Theory and Communications.
CoRR, 2017

On the error probability of stochastic decision and stochastic decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices.
Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

2016
Construction of a Channel Code from an Arbitrary Source Code with Decoder Side Information.
CoRR, 2016

Active Bayesian observer correcting overconfidence effects due to E-type confirmatory bias.
Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

Fundamental limits are achievable with countable alphabet.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Construction of a channel code from an arbitrary source code with decoder side information.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015
Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator.
IEEE Trans. Inf. Theory, 2015

Secret-Key Distribution Based on Bounded Observability.
Proc. IEEE, 2015

Index coding over correlated sources.
Proceedings of the 2015 International Symposium on Network Coding, 2015

Variable-Length Lossy Compression Algorithms Based on Constrained Random Numbers.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Channel Coding and Lossy Source Coding Using a Generator of Constrained Random Numbers.
IEEE Trans. Inf. Theory, 2014

Formulas for limit superior/inferior in probability.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

General formula for secrecy capacity of wiretap channel with noncausal state.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Corrections to "Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding".
IEEE Trans. Inf. Theory, 2013

Channel Coding and Lossy Source Coding Using a Constrained Random Number Generator
CoRR, 2013

Equivalence of inner regions for broadcast channel coding.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Channel code using a constrained Random number generator.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Lossy source code using a constrained random number generator.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Corrections to "Hash Property and Fixed-Rate Universal Coding Theorems".
IEEE Trans. Inf. Theory, 2012

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, 2012

Uniform random number generation by using sparse matrix.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Universal codes on continuous alphabet using sparse matrices.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

On a construction of universal network code using LDPC matrices.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Construction of multiple access channel codes based on hash property.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Construction of strongly secure wiretap channel code based on hash property.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Hash property and fixed-rate universal coding theorems.
IEEE Trans. Inf. Theory, 2010

Hash property and coding theorems for sparse matrices and maximum-likelihood coding.
IEEE Trans. Inf. Theory, 2010

Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property
CoRR, 2010

Construction of broadcast channel code based on hash property.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
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., 2009

Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices
CoRR, 2009

Coding theorem for general stationary memoryless channel based on hash property.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Information Theoretic Security Based on Bounded Observability.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008
Effect of Random Permutation of Symbols in a Sequence.
IEEE Trans. Inf. Theory, 2008

A Construction of Lossy Source Code Using LDPC Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2006
Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack.
IEEE Trans. Inf. Theory, 2006

Secret Key Capacity and Advantage Distillation Capacity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005
Low-density parity-check matrices for coding of correlated sources.
IEEE Trans. Inf. Theory, 2005

Simulated Random Coding Algorithm for Correlated Sources with Ensemble of Linear Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Source Coding Algorithms Using the Randomness of a Past Sequence.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Secret key agreement under sampling attack.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Secret key agreement from correlated source outputs using LDPC matrices.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the Problem of Generating Mutually Independent Random Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Low density parity check matrices for coding of multiple access networks.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
On the performance of recency-rank and block-sorting universal lossless data compression algorithms.
IEEE Trans. Inf. Theory, 2002

An Information-Spectrum Approach to Rate-Distortion Function with Side Information.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

1999
Almost-Sure Variable-Length Source Coding Theorems for General Sources.
IEEE Trans. Inf. Theory, 1999


  Loading...