42 citations · 80 across the 16 of their papers we have counts for
17 papers
A Probabilistic Shaping Approach for Optical Region-of-Interest Signaling
Duc-Phuc Nguyen, Yoshifumi Shiraki, Jun Muramatsu +1
We propose a probabilistic shaping approach for region-of-interest signaling, where a low-rate signal controls the desired probabilistic ranges of a high-rate data stream using a f…
Channel Codes for Relayless Networks with General Message Access Structure
Jun Muramatsu
Channel codes for relayless networks with the general message access structure is introduced. It is shown that the multi-letter characterized capacity region of this network is ach…
On the Achievability of Interference Channel Coding
Jun Muramatsu
This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin…
Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization
Jun Muramatsu
This paper introduces algorithms for the successive-cancellation decoding and the successive-cancellation list decoding of binary polar source/channel codes. By using the symmetric…
Binary Polar Codes Based on Bit Error Probability
Jun Muramatsu
This paper introduces techniques to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding. The polarization lemma is re…
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory
A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama +24
This year, 2019 we celebrate 30 years of our friendship between Asian and European scientists at the AEW11 in Rotterdam, the Netherlands. Many of the 1989 participants are also pre…
Successive-Cancellation Decoding of Linear Source Code
Jun Muramatsu
This paper investigates the error probability of several decoding methods for a source code with decoder side information, where the decoding methods are: 1) symbol-wise maximum a…
Multi-Terminal Codes Using Constrained-Random-Number Generators
Jun Muramatsu, Shigeki Miyake
A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, which are building blocks f…
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications
Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane +31
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperati…
On the error probability of stochastic decision and stochastic decoding
Jun Muramatsu, Shigeki Miyake
This paper investigates the error probability of a stochastic decision and the way in which it differs from the error probability of an optimal decision, i.e., the maximum a poster…
Construction of a Channel Code from an Arbitrary Source Code with Decoder Side Information
Jun Muramatsu, Shigeki Miyake
The construction of a channel code by using a source code with decoder side information is introduced. For the construction, any pair of encoder and decoder is available for a sour…
Channel Coding and Lossy Source Coding Using a Constrained Random Number Generator
Jun Muramatsu
Stochastic encoders for channel coding and lossy source coding are introduced with a rate close to the fundamental limits, where the only restriction is that the channel input alph…
Construction of Multiple Access Channel Codes Based on Hash Property
Jun Muramatsu, Shigeki Miyake
The aim of this paper is to introduce the construction of codes for a general discrete stationary memoryless multiple access channel based on the the notion of the hash property. S…
Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property
Jun Muramatsu, Shigeki Miyake
The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion…
Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices
Jun Muramatsu, Shigeki Miyake
The aim of this paper is to prove coding theorems for the wiretap channel coding problem and secret key agreement problem based on the the notion of a hash property for an ensemble…
Hash Property and Fixed-rate Universal Coding Theorems
Jun Muramatsu, Shigeki Miyake
The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed…
Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding
Jun Muramatsu, Shigeki Miyake
The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and ma…