• Publications
  • Influence
Polar Coding Without Alphabet Extension for Asymmetric Models
TLDR
A new polar coding scheme for asymmetric settings that can attain the channel capacity without any alphabet extension by invoking results on polar coding for lossless compression. Expand
  • 132
  • 33
  • PDF
Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.)
TLDR
A modified Schalkwijk-Barron transmission scheme is presented for channels with noiseless feedback in place of Viterbi's sequential decision feedback. Expand
  • 130
  • 22
Secret sharing system using (k, L, n) threshold scheme
In the (k, n) threshold scheme, the information X is partitioned and coded into subinformation. If any k subinformation is obtained among n subinformation, the original information X can be recoveredExpand
  • 113
  • 16
Private information retrieval for coded storage
TLDR
We propose a class of linear storage codes and retrieval schemes and derive conditions under which our schemes are error-free and private. Expand
  • 137
  • 12
  • PDF
Viterbi decoding algorithm for convolutional codes with repeat request
TLDR
Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resulting performance is analyzed by random coding and generating function arguments and simulation. Expand
  • 132
  • 12
  • PDF
A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers
TLDR
A new source coding problem is considered for a one-way communication system with correlated source outputs \{XY\} . Expand
  • 110
  • 10
  • PDF
Wyner-Ziv theory for a general function of the correlated sources
  • Hirosuke Yamamoto
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1 September 1982
TLDR
A source coding problem is considered for the Wyner-Ziv type system where the decoder is required to estimate the value of some function of the encoder input and the side information. Expand
  • 78
  • 10
  • PDF
Asymptotic properties on codeword lengths of an optimal FV code for general sources
TLDR
This correspondence is concerned with asymptotic properties on the codeword length of a fixed-to-variable length code (FV code) for a general source {X/sup n/}/sub n=1//sup /spl infin// with a finite or countably infinite alphabet. Expand
  • 34
  • 9
  • PDF
Quantum secret sharing schemes and reversibility of quantum operations
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A 61, 042311Expand
  • 41
  • 8
  • PDF
Rate-distortion theory for the Shannon cipher system
TLDR
Considers Shannon's cipher system with a memoryless broadcast channel with a noisy wiretap channel. Expand
  • 97
  • 7
  • PDF