The SCEAS System
| |||||||

## Search the dblp DataBase
Hirosuke Yamamoto:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mitsugu Iwamoto, Hirosuke Yamamoto
**Strongly secure ramp secret sharing schemes for general access structures.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:2, pp:52-57 [Journal] - Mitsuharu Arimura, Hirosuke Yamamoto
**Asymptotic redundancy of the MTF scheme for stationary ergodic sources.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3742-3752 [Journal] - Tsutomu Kawabata, Hirosuke Yamamoto
**A new implementation of the Ziv-Lempel incremental parsing algorithm.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:5, pp:1439-0 [Journal] - Yuko Matsunaga, Hirosuke Yamamoto
**A coding theorem for lossy data compression by LDPC codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2225-2229 [Journal] - Hirosuke Yamamoto
**Wyner-Ziv theory for a general function of the correlated sources.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:5, pp:803-0 [Journal] - Hirosuke Yamamoto
**Correction to 'Wyner-Ziv theory for a general function of the correlated sources' (Sep 82 803-807).**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:2, pp:320- [Journal] - Hirosuke Yamamoto
**A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:918-0 [Journal] - Hirosuke Yamamoto
**On secret sharing communication systems with two or three channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:387-393 [Journal] - Hirosuke Yamamoto
**A rate-distortion problem for a communication system with a secondary decoder to be hindered.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:835-842 [Journal] - Hirosuke Yamamoto
**Coding theorem for secret sharing communication systems with two noisy channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:572-578 [Journal] - Hirosuke Yamamoto
**A coding theorem for secret sharing communication systems with two Gaussian wiretap channels.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:634-0 [Journal] - Hirosuke Yamamoto
**Coding theorems for Shannon's cipher system with correlated source outputs, and common information.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:85-95 [Journal] - Hirosuke Yamamoto
**Source coding theory for a triangular communication system.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:848-853 [Journal] - Hirosuke Yamamoto
**Rate-distortion theory for the Shannon cipher system.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:827-835 [Journal] - Hirosuke Yamamoto, T. Itoh
**Competitive optimality of source codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2015-2019 [Journal] - Hirosuke Yamamoto, Hiroshi Ochi
**A new asymptotically optimal code for the positive integers.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:5, pp:1420-0 [Journal] - Hirosuke Yamamoto
**A new recursive universal code of the positive integers.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:717-723 [Journal] - Hirosuke Yamamoto
**Source coding theory for cascade and branching communication systems.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1981, v:27, n:3, pp:299-307 [Journal] - Hirosuke Yamamoto, Hidetoshi Yokoo
**Average-sense optimality and competitive optimality for almost instantaneous VF codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2174-2184 [Journal] **Anomaly Detection Using Time Index Differences of Identical Symbols with and without Training Data.**[Citation Graph (, )][DBLP]**Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes.**[Citation Graph (, )][DBLP]**Representative sequence selection in unsupervised anomaly detection using spectrum kernel with theoretical parameter setting.**[Citation Graph (, )][DBLP]**Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures**[Citation Graph (, )][DBLP]**Strongly secure ramp secret sharing schemes for general access structures**[Citation Graph (, )][DBLP]**Asymptotically Optimal Tree-based Group Key Management Schemes**[Citation Graph (, )][DBLP]**Secure multiplex coding to attain the channel capacity in wiretap channels**[Citation Graph (, )][DBLP]**On zero-rate error exponent for BSC with noisy feedback**[Citation Graph (, )][DBLP]**Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares**[Citation Graph (, )][DBLP]
Search in 0.035secs, Finished in 0.036secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |