default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirosuke Yamamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c53]Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, Hirosuke Yamamoto:
AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost. ISIT 2024: 49-54- [c52]Hirosuke Yamamoto, Ken-ichi Iwata:
An Asymmetric Encoding - Decoding Scheme for Lossless Data Compression. ISIT 2024: 55-60 - [i19]Hirosuke Yamamoto, Ken-ichi Iwata:
Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths. CoRR abs/2408.07322 (2024) - 2022
- [c51]Ken-ichi Iwata, Hirosuke Yamamoto:
Joint Coding for Discrete Sources and Finite-State Noiseless Channels. ISIT 2022: 3327-3332 - [c50]Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto:
Enumeration and Coding of Binary AIFV-m Code Trees. ISITA 2022: 94-98 - 2021
- [c49]Ken-ichi Iwata, Hirosuke Yamamoto
:
AIVF Codes Based on Iterative Algorithm and Dynamic Programming. ISIT 2021: 2018-2023 - 2020
- [j48]Lan V. Truong, Hirosuke Yamamoto:
On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback. IEEE Trans. Inf. Theory 66(2): 722-741 (2020) - [c48]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
On a Redundancy of AIFV-m Codes for m =3, 5. ISIT 2020: 2355-2359 - [c47]Hirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, Ken-ichi Iwata:
A Universal Data Compression Scheme based on the AIVF Coding Techniques. ISIT 2020: 2360-2364 - [c46]Ken-ichi Iwata, Hirosuke Yamamoto:
An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes. ITW 2020: 1-5
2010 – 2019
- 2019
- [c45]Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto:
Enumeration and Coding of Compact Code Trees for Binary AIFV Codes. ISIT 2019: 1527-1531 - [c44]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States. ISIT 2019: 1902-1906 - [i18]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019) - 2018
- [c43]Tomotaka Hiraoka, Hirosuke Yamamoto:
Alphabetic AIFV Codes Constructed from Hu- Tucker codes. ISIT 2018: 2182-2186 - [c42]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Optimality Proof of the Iterative Algorithm for AIFV-m Codes. ISIT 2018: 2187-2191 - [c41]Tomotaka Hiraoka, Hirosuke Yamamoto:
Dynamic AIFV Coding. ISITA 2018: 545-549 - [i17]Lan V. Truong, Hirosuke Yamamoto:
On the Capacity of Symmetric M-user Gaussian Interference Channels with Feedback. CoRR abs/1807.10881 (2018) - 2017
- [j47]Lan V. Truong, Hirosuke Yamamoto:
Posterior Matching for Gaussian Broadcast Channels with Feedback. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(5): 1165-1178 (2017) - [j46]Wataru Nakamura, Hirosuke Yamamoto, Terence Chan:
A Cheating-Detectable (k, L, n) Ramp Secret Sharing Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2709-2719 (2017) - [j45]Weihua Hu, Hirosuke Yamamoto, Junya Honda:
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes. IEEE Trans. Inf. Theory 63(8): 5074-5086 (2017) - [c40]Kentaro Sumigawa, Hirosuke Yamamoto:
Coding of binary AIFV code trees. ISIT 2017: 1152-1156 - [c39]Hirosuke Yamamoto, Shintaro Hara:
Application of Yamamoto-Itoh coding scheme to discrete memoryless broadcast channels. ISIT 2017: 1878-1882 - [c38]Marat V. Burnashev, Hirosuke Yamamoto:
On optimal error exponents in noiseless channel identification. ISIT 2017: 2737-2740 - [c37]Junya Honda, Hirosuke Yamamoto:
Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding. ISIT 2017: 2850-2854 - [c36]Hirosuke Yamamoto, Ken-ichi Iwata:
An iterative algorithm to construct optimal binary AIFV-m codes. ITW 2017: 519-523 - [i16]Junya Honda, Hirosuke Yamamoto:
Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric Channel Coding. CoRR abs/1706.06775 (2017) - [i15]Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane, Yanling Chen, Peter H. N. de With, Héla Gassara, Hamed Gharbi, Adel Ghazel, Khaled Grati, Naira M. Grigoryan, Ashot N. Harutyunyan, Masayuki Imanishi, Mitsugu Iwamoto, Ken-ichi Iwata, Hiroshi Kamabe, Brian M. Kurkoski, Shigeaki Kuzuoka, Patrick Langenhuizen, Jan Lewandowsky, Akiko Manada, Shigeki Miyake, Hiroyoshi Morita, Jun Muramatsu, Safa Najjar, Arnak V. Poghosyan, Fatma Rouissi, Yuta Sakai, Ulrich Tamm, Joost van der Putten, Fons van der Sommen, A. J. Han Vinck, Tadashi Wadayama, Dirk Wübben, Hirosuke Yamamoto:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2016
- [j44]Hirosuke Yamamoto, Yuka Kuwaori:
Direct- or Fast-Access Decoding Schemes for VF Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2291-2295 (2016) - [c35]Weihua Hu, Hirosuke Yamamoto, Junya Honda:
Tight upper bounds on the redundancy of optimal binary AIFV codes. ISIT 2016: 6-10 - [c34]Hirosuke Yamamoto, Qiqiang Liu:
Highly sensitive universal statistical test. ISIT 2016: 700-704 - [c33]Marat V. Burnashev, Hirosuke Yamamoto:
On optimal transmission strategies for channels with noiseless feedback. ISIT 2016: 1282-1286 - [c32]Junya Honda, Hirosuke Yamamoto:
Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias code. ISITA 2016: 11-15 - [c31]Wataru Nakamura, Hirosuke Yamamoto, Terence Chan:
A ramp threshold secret sharing scheme against cheating by substitution attacks. ISITA 2016: 340-344 - [c30]Ken-ichi Iwata, Hirosuke Yamamoto:
A dynamic programming algorithm to construct optimal code trees of AIFV codes. ISITA 2016: 641-645 - [i14]Junya Honda, Hirosuke Yamamoto:
Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code. CoRR abs/1607.06914 (2016) - [i13]Weihua Hu, Hirosuke Yamamoto, Junya Honda:
Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes. CoRR abs/1607.07247 (2016) - 2015
- [j43]Hirosuke Yamamoto, Masashi Ueda:
Multiple Object Identification Coding. IEEE Trans. Inf. Theory 61(8): 4269-4276 (2015) - [j42]Hirosuke Yamamoto, Masato Tsuchihashi, Junya Honda:
Almost Instantaneous Fixed-to-Variable Length Codes. IEEE Trans. Inf. Theory 61(12): 6432-6443 (2015) - [c29]Lan V. Truong, Hirosuke Yamamoto:
On the capacity of symmetric Gaussian interference channels with feedback. ISIT 2015: 201-205 - [c28]Runxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu:
FV polar coding for lossy compression with an improved exponent. ISIT 2015: 1517-1521 - [c27]Terence H. Chan, Siu-Wai Ho, Hirosuke Yamamoto:
Private information retrieval for coded storage. ISIT 2015: 2842-2846 - [c26]Runxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou:
Construction of polar codes for channels with memory. ITW Fall 2015: 187-191 - [i12]Marat V. Burnashev, Hirosuke Yamamoto:
On Using Feedback in a Gaussian Channel. CoRR abs/1501.04887 (2015) - [i11]Hirosuke Yamamoto, Masato Tsuchihashi, Junya Honda:
Almost Instantaneous Fix-to-Variable Length Codes. CoRR abs/1507.08733 (2015) - 2014
- [j41]Marat V. Burnashev, Hirosuke Yamamoto:
On using noisy feedback in a Gaussian channel. Probl. Inf. Transm. 50(3): 217-231 (2014) - [j40]Junya Honda, Hirosuke Yamamoto:
Variable Length Lossy Coding Using an LDPC Code. IEEE Trans. Inf. Theory 60(1): 762-775 (2014) - [c25]Hirosuke Yamamoto, Masashi Ueda:
Identification codes to identify multiple objects. ISIT 2014: 1241-1245 - [c24]Marat V. Burnashev, Hirosuke Yamamoto:
Noisy feedback improves the Gaussian channel reliability function. ISIT 2014: 2554-2558 - [i10]Hirosuke Yamamoto, Masashi Ueda:
Identification Codes to Identify Multiple Objects. CoRR abs/1410.4612 (2014) - [i9]Terence H. Chan, Siu-Wai Ho, Hirosuke Yamamoto:
Private Information Retrieval for Coded Storage. CoRR abs/1410.5489 (2014) - 2013
- [j39]Junya Honda, Hirosuke Yamamoto:
Polar Coding Without Alphabet Extension for Asymmetric Models. IEEE Trans. Inf. Theory 59(12): 7829-7838 (2013) - [j38]Daisuke Kobayashi, Hirosuke Yamamoto, Tomohiro Ogawa:
Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels. IEEE Trans. Inf. Theory 59(12): 8131-8143 (2013) - [c23]Hirosuke Yamamoto, Xiaofeng Wei:
Almost instantaneous FV codes. ISIT 2013: 1759-1763 - 2012
- [j37]Jun Kogure, Noboru Kunihiro, Hirosuke Yamamoto:
On the Hardness of Subset Sum Problem from Different Intervals. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(5): 903-908 (2012) - [j36]Marat V. Burnashev, Hirosuke Yamamoto:
On the reliability function for a noisy feedback Gaussian channel: Zero rate. Probl. Inf. Transm. 48(3): 199-216 (2012) - [j35]Mitsugu Iwamoto, Hiroki Koga, Hirosuke Yamamoto:
Coding Theorems for a (2, 2)-Threshold Scheme With Detectability of Impersonation Attacks. IEEE Trans. Inf. Theory 58(9): 6194-6206 (2012) - [c22]Junya Honda, Hirosuke Yamamoto:
Polar coding without alphabet extension for asymmetric channels. ISIT 2012: 2147-2151 - [c21]Marat V. Burnashev, Hirosuke Yamamoto:
On decoding error exponent of Gaussian channel with noisy feedback: Nonexponential number of messages. ISIT 2012: 2954-2958 - [c20]Junya Honda, Hirosuke Yamamoto:
Fast Linear-Programming decoding of LDPC codes over GF(2m). ISITA 2012: 754-758 - [i8]Marat V. Burnashev, Hirosuke Yamamoto:
On Reliability Function of Gaussian Channel with Noisy Feedback: Zero Transmission Rate. CoRR abs/1208.2786 (2012) - 2011
- [c19]Hirosuke Yamamoto, Keishi Okudera:
Channel coding theorem for the number of guesses in decoding. ISIT 2011: 508-512 - [c18]Jun Kogure, Noboru Kunihiro, Hirosuke Yamamoto:
Generalized Security Analysis of the Random Key Bits Leakage Attack. WISA 2011: 13-27 - 2010
- [j34]Kenji Hamano, Hirosuke Yamamoto:
A Randomness Test Based on T-Complexity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(7): 1346-1354 (2010) - [j33]Marat V. Burnashev, Hirosuke Yamamoto:
On the reliability function for a BSC with noisy feedback. Probl. Inf. Transm. 46(2): 103-121 (2010) - [c17]Kenji Hamano, Hirosuke Yamamoto:
Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes. DCC 2010: 531 - [c16]Stefan Skludarek, Hirosuke Yamamoto:
Representative sequence selection in unsupervised anomaly detection using spectrum kernel with theoretical parameter setting. ICMLC 2010: 2099-2104 - [c15]Manabu Koide, Hirosuke Yamamoto:
Coding theorems for biometric systems. ISIT 2010: 2647-2651 - [c14]Akari Sato, Hirosuke Yamamoto:
Error exponents of discrete memoryless channels and AWGN channels with noisy feedback. ISITA 2010: 452-457 - [i7]Mitsugu Iwamoto, Hiroki Koga, Hirosuke Yamamoto:
Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares. CoRR abs/1004.4530 (2010) - [i6]Marat V. Burnashev, Hirosuke Yamamoto:
On Reliability Function of BSC with Noisy Feedback. CoRR abs/1011.2180 (2010)
2000 – 2009
- 2009
- [j32]Kenji Hamano, Fumio Sato, Hirosuke Yamamoto:
A New Randomness Test Based on Linear Complexity Profile. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(1): 166-172 (2009) - [j31]Tomohiko Uyematsu, Hirosuke Yamamoto:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(10): 2391-2392 (2009) - [c13]Stefan Skludarek, Hirosuke Yamamoto:
Anomaly Detection Using Time Index Differences of Identical Symbols with and without Training Data. ADMA 2009: 619-626 - [c12]Kunihiko Harada, Hirosuke Yamamoto:
Separate network coding for private and common messages from one source to two sinks. ISIT 2009: 418-422 - [c11]Kenji Hamano, Hirosuke Yamamoto:
A differential equation method to derive the formulas of the T-complexity and the LZ-complexity. ISIT 2009: 625-629 - [c10]Mitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga:
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes. ISIT 2009: 1308-1312 - [c9]Hirosuke Yamamoto, Marat V. Burnashev:
Noisy feedback improves the BSC reliability function. ISIT 2009: 1501-1505 - [c8]Junya Honda, Hirosuke Yamamoto:
Variable length lossy coding using an LDPC code. ISIT 2009: 1973-1977 - 2008
- [j30]Kunihiko Harada, Hirosuke Yamamoto:
Strongly Secure Linear Network Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(10): 2720-2728 (2008) - [j29]Marat V. Burnashev, Hirosuke Yamamoto:
On the zero-rate error exponent for a BSC with noisy feedback. Probl. Inf. Transm. 44(3): 198-213 (2008) - [j28]Yutaka Hayashi, Hirosuke Yamamoto:
Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs. IEEE Trans. Inf. Theory 54(6): 2808-2817 (2008) - [c7]Marat V. Burnashev, Hirosuke Yamamoto:
On BSC, noisy feedback and three messages. ISIT 2008: 886-889 - [i5]Marat V. Burnashev, Hirosuke Yamamoto:
On zero-rate error exponent for BSC with noisy feedback. CoRR abs/0808.2092 (2008) - 2007
- [j27]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 101-112 (2007) - [c6]Hirosuke Yamamoto, Daichi Isami:
Multiplex Coding of Bit Commitment Based on a Discrete Memoryless Channel. ISIT 2007: 721-725 - 2006
- [j26]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes for general access structures. Inf. Process. Lett. 97(2): 52-57 (2006) - [c5]Yutaka Hayashi, Hirosuke Yamamoto:
The coding theorems for the Shannon cipher system with a guessing wiretapper and correlated source outputs. ISIT 2006: 1169-1173 - 2005
- [j25]Hiroki Koga, Hirosuke Yamamoto:
Asymptotic properties on codeword lengths of an optimal FV code for general sources. IEEE Trans. Inf. Theory 51(4): 1546-1555 (2005) - [j24]Mitsuharu Arimura, Hirosuke Yamamoto:
Asymptotic redundancy of the MTF scheme for stationary ergodic sources. IEEE Trans. Inf. Theory 51(11): 3742-3752 (2005) - [c4]Daisuke Kobayashi, Hirosuke Yamamoto, Tomohiro Ogawa:
How to attain the ordinary channel capacity securely in wiretap channels. ICITS 2005: 13-18 - [c3]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes. ISIT 2005: 1221-1225 - [c2]Hideyuki Sakai, Hirosuke Yamamoto:
Asymptotic optimality of tree-based group key management schemes. ISIT 2005: 2275-2279 - [i4]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures. CoRR abs/cs/0506064 (2005) - [i3]Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes for general access structures. CoRR abs/cs/0506065 (2005) - [i2]Hideyuki Sakai, Hirosuke Yamamoto:
Asymptotically Optimal Tree-based Group Key Management Schemes. CoRR abs/cs/0507001 (2005) - [i1]Daisuke Kobayashi, Hirosuke Yamamoto, Tomohiro Ogawa:
Secure multiplex coding to attain the channel capacity in wiretap channels. CoRR abs/cs/0509047 (2005) - 2004
- [c1]Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal multiple assignments based on integer programming in secret sharing schemes. ISIT 2004: 16 - 2003
- [j23]Mitsugu Iwamoto, Hirosuke Yamamoto:
A Construction Method of Visual Secret Sharing Schemes for Plural Secret Images. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2577-2588 (2003) - [j22]Yuko Matsunaga, Hirosuke Yamamoto:
A coding theorem for lossy data compression by LDPC codes. IEEE Trans. Inf. Theory 49(9): 2225-2229 (2003) - 2002
- [j21]Mitsugu Iwamoto, Hirosuke Yamamoto:
The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(10): 2238-2247 (2002) - 2001
- [j20]Hirosuke Yamamoto, Hidetoshi Yokoo:
Average-sense optimality and competitive optimality for almost instantaneous VF codes. IEEE Trans. Inf. Theory 47(6): 2174-2184 (2001) - 2000
- [j19]Hirosuke Yamamoto:
A new recursive universal code of the positive integers. IEEE Trans. Inf. Theory 46(2): 717-723 (2000)
1990 – 1999
- 1997
- [j18]Hirosuke Yamamoto:
Rate-distortion theory for the Shannon cipher system. IEEE Trans. Inf. Theory 43(3): 827-835 (1997) - 1996
- [j17]Hirosuke Yamamoto:
Source coding theory for a triangular communication system. IEEE Trans. Inf. Theory 42(3): 848-853 (1996) - 1995
- [j16]Hirosuke Yamamoto, Tadaaki Itoh:
Competitive optimality of source codes. IEEE Trans. Inf. Theory 41(6): 2015-2019 (1995) - 1994
- [j15]Hirosuke Yamamoto:
Coding theorems for Shannon's cipher system with correlated source outputs, and common information. IEEE Trans. Inf. Theory 40(1): 85-95 (1994) - 1991
- [j14]Hirosuke Yamamoto:
A coding theorem for secret sharing communication systems with two Gaussian wiretap channels. IEEE Trans. Inf. Theory 37(3): 634-638 (1991) - [j13]Hirosuke Yamamoto, Hiroshi Ochi:
A new asymptotically optimal code for the positive integers. IEEE Trans. Inf. Theory 37(5): 1420-1429 (1991) - [j12]Tsutomu Kawabata, Hirosuke Yamamoto:
A new implementation of the Ziv-Lempel incremental parsing algorithm. IEEE Trans. Inf. Theory 37(5): 1439-1440 (1991)
1980 – 1989
- 1989
- [j11]Masaki Hashizume, Hirosuke Yamamoto, Takeomi Tamesada, Toshiaki Hanibuti:
Evaluation of a retrieval system using content addressable memory. Syst. Comput. Jpn. 20(7): 1-9 (1989) - [j10]Hirosuke Yamamoto:
Coding theorem for secret sharing communication systems with two noisy channels. IEEE Trans. Inf. Theory 35(3): 572-578 (1989) - 1988
- [j9]Hirosuke Yamamoto:
A rate-distortion problem for a communication system with a secondary decoder to be hindered. IEEE Trans. Inf. Theory 34(4): 835-842 (1988) - 1986
- [j8]Hirosuke Yamamoto:
On secret sharing communication systems with two or three channels. IEEE Trans. Inf. Theory 32(3): 387-393 (1986) - 1983
- [j7]Hirosuke Yamamoto:
Correction to 'Wyner-Ziv theory for a general function of the correlated sources' (Sep 82 803-807). IEEE Trans. Inf. Theory 29(2): 320 (1983) - [j6]Hirosuke Yamamoto:
A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers. IEEE Trans. Inf. Theory 29(6): 918-923 (1983) - 1982
- [j5]Hirosuke Yamamoto:
Wyner-Ziv theory for a general function of the correlated sources. IEEE Trans. Inf. Theory 28(5): 803-807 (1982) - 1981
- [j4]Hirosuke Yamamoto:
Source coding theory for cascade and branching communication systems. IEEE Trans. Inf. Theory 27(3): 299-307 (1981) - 1980
- [j3]Hirosuke Yamamoto, Kohji Itoh:
Viterbi decoding algorithm for convolutional codes with repeat request. IEEE Trans. Inf. Theory 26(5): 540-547 (1980) - [j2]Hirosuke Yamamoto, Kohji Itoh:
Correction to 'Asymptotic Performance of a Modified Schalkwijk-Barron Scheme for Channels with Noiseless Feedback'. IEEE Trans. Inf. Theory 26(5): 628 (1980)
1970 – 1979
- 1979
- [j1]Hirosuke Yamamoto, Kohji Itoh:
Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.). IEEE Trans. Inf. Theory 25(6): 729-733 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
