| 2009 |
|---|
| 12 | EE | 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 |
|---|
| 11 | EE | Jun Muramatsu,
Shigeki Miyake:
Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding
CoRR abs/0801.3878: (2008) |
| 10 | EE | Jun Muramatsu,
Shigeki Miyake:
Hash Property and Fixed-rate Universal Coding Theorems
CoRR abs/0804.1183: (2008) |
| 9 | EE | Jun Muramatsu:
Effect of Random Permutation of Symbols in a Sequence.
IEEE Transactions on Information Theory 54(1): 78-86 (2008) |
| 8 | EE | Shigeki Miyake,
Jun Muramatsu:
A Construction of Lossy Source Code Using LDPC Matrices.
IEICE Transactions 91-A(6): 1488-1501 (2008) |
| 2006 |
|---|
| 7 | EE | Jun Muramatsu,
Kazuyuki Yoshimura,
Peter Davis:
Secret Key Capacity and Advantage Distillation Capacity.
IEICE Transactions 89-A(10): 2589-2596 (2006) |
| 6 | EE | Jun Muramatsu:
Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices.
IEICE Transactions 89-A(7): 2036-2046 (2006) |
| 2005 |
|---|
| 5 | EE | Jun Muramatsu,
Tomohiko Uyematsu,
Tadashi Wadayama:
Low-density parity-check matrices for coding of correlated sources.
IEEE Transactions on Information Theory 51(10): 3645-3654 (2005) |
| 4 | EE | Jun Muramatsu:
Source Coding Algorithms Using the Randomness of a Past Sequence.
IEICE Transactions 88-A(4): 1063-1083 (2005) |
| 3 | EE | Jun Muramatsu,
Takafumi Mukouchi:
Simulated Random Coding Algorithm for Correlated Sources with Ensemble of Linear Matrices.
IEICE Transactions 88-A(9): 2475-2480 (2005) |
| 2002 |
|---|
| 2 | | Jun Muramatsu:
On the performance of recency-rank and block-sorting universal lossless data compression algorithms.
IEEE Transactions on Information Theory 48(9): 2621-2625 (2002) |
| 1999 |
|---|
| 1 | | Jun Muramatsu,
Fumio Kanaya:
Almost-Sure Variable-Length Source Coding Theorems for General Sources.
IEEE Transactions on Information Theory 45(1): 337-342 (1999) |
