{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:13:39Z","timestamp":1744949619614,"version":"3.40.4"},"publisher-location":"Cham","reference-count":124,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031820137"},{"type":"electronic","value":"9783031820144"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-82014-4_19","type":"book-chapter","created":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T18:15:16Z","timestamp":1743185716000},"page":"505-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ning Cai: A Tribute to\u00a0a\u00a0Pioneering Scholar in\u00a0Information Theory"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8375-8946","authenticated-orcid":false,"given":"Holger","family":"Boche","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2265-4887","authenticated-orcid":false,"given":"Christian","family":"Deppe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0872-0288","authenticated-orcid":false,"given":"Ulrich","family":"Tamm","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6344-4870","authenticated-orcid":false,"given":"Andreas","family":"Winter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7386-4027","authenticated-orcid":false,"given":"Raymond W.","family":"Yeung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"issue":"1","key":"19_CR1","first-page":"42","volume":"4","author":"N Cai","year":"1984","unstructured":"Cai, N., Zhang, Z.Z.: The construction of diversity measures and their inconsistency. J. Syst. Sci. Math. Sci. 4(1), 42 (1984)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"19_CR2","unstructured":"Cai, N.: On achievable rate regions of F-codes for correlated sources. In: Proceeding of CIE National Symposium on Information Theory (1985)"},{"issue":"2","key":"19_CR3","first-page":"129","volume":"6","author":"N Cai","year":"1986","unstructured":"Cai, N.: A bound of sizes of code pairs satisfying the strong 4-words property for Lee distance. J. Syst. Sci. Math. Sci. 6(2), 129 (1986)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"19_CR4","unstructured":"Cai, N.: On maximum expectation of logarithms of the RV family F(B). In: Proceeding of National Conference on Probability Theory and Statistics (1986)"},{"issue":"4","key":"19_CR5","first-page":"49","volume":"6","author":"N Cai","year":"1986","unstructured":"Cai, N.: On the uniquely decodable codes of 3-users 2N -frequency noiseless MAC with intensity information. Acta Electron. Sin. 6(4), 49\u201356 (1986)","journal-title":"Acta Electron. Sin."},{"issue":"4","key":"19_CR6","first-page":"289","volume":"3","author":"ZZ Zhang","year":"1987","unstructured":"Zhang, Z.Z., Cai, N.: On variable length coding with side information for discrete memoryless sources. Acta Electron. Sin. 3(4), 289\u2013297 (1987)","journal-title":"Acta Electron. Sin."},{"key":"19_CR7","unstructured":"Cai, N.: 4-words and diametrical inequalities. PhD thesis. University of Bielefeld (1988)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0196-8858(89)90004-3","volume":"10","author":"R Ahlswede","year":"1989","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: A general 4-words inequality with consequences for 2-way communication complexity. Adv. Appl. Math. 10, 75\u201394 (1989)","journal-title":"Adv. Appl. Math."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: A recursive bound for the number of complete K-subgraphs of a graph. Springer (1990)","DOI":"10.1007\/978-3-642-46908-4_3"},{"issue":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/18.104326","volume":"37","author":"R Ahlswede","year":"1991","unstructured":"Ahlswede, R., Cai, N.: Two proofs of Pinsker\u2019s conjecture concerning arbitrarily varying channels. IEEE Trans. Inf. Theory 37(6), 1647\u20131649 (1991). https:\/\/doi.org\/10.1109\/18.104326","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01191200","volume":"12","author":"R Ahlswede","year":"1992","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: Diametric theorems in sequence spaces. Combinatorica 12(1), 1\u201317 (1992). https:\/\/doi.org\/10.1007\/BF01191200","journal-title":"Combinatorica"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01202350","volume":"13","author":"R Ahlswede","year":"1993","unstructured":"Ahlswede, R., Cai, N.: A generalization of the AZ identity. Comb. 13(3), 241\u2013248 (1993). https:\/\/doi.org\/10.1007\/BF01202350","journal-title":"Comb."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1017\/S0963548300000626","volume":"2","author":"R Ahlswede","year":"1993","unstructured":"Ahlswede, R., Cai, N.: On extremal set partitions in cartesian product spaces. Comb. Probab. Comput. 2, 211\u2013220 (1993). https:\/\/doi.org\/10.1017\/S0963548300000626","journal-title":"Comb. Probab. Comput."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01200149","volume":"4","author":"R Ahlswede","year":"1993","unstructured":"Ahlswede, R., Cai, N.: Rank formulas for certain products of matrices. Appl. Algebra Eng. Commun. Comput. 4, 253\u2013261 (1993). https:\/\/doi.org\/10.1007\/BF01200149","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"2062","DOI":"10.1109\/18.340481","volume":"40","author":"R Ahlswede","year":"1994","unstructured":"Ahlswede, R., Cai, N.: On communication complexity of vectorvalued functions. IEEE Trans. Inf. Theory 40(6), 2062\u20132067 (1994). https:\/\/doi.org\/10.1109\/18.340481","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0963548300001334","volume":"3","author":"R Ahlswede","year":"1994","unstructured":"Ahlswede, R., Cai, N.: On partitioning and packing products with rectangles. Comb. Probab. Comput. 3, 429\u2013434 (1994). https:\/\/doi.org\/10.1017\/S0963548300001334","journal-title":"Comb. Probab. Comput."},{"key":"19_CR17","unstructured":"Sprenger, G., Weingart, P.: Das Zentrum f\u00fcr interdisziplin\u00e4re Forschung. In: Reformuniversit\u00e4t Bielefeld: 1969-1994; zwischen Defensive und Innovation (1994)"},{"issue":"8","key":"19_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1006\/EUJC.1996.0059","volume":"17","author":"R Ahlswede","year":"1996","unstructured":"Ahlswede, R., Cai, N.: Incomparability and intersection properties of Boolean interval lattices and chain Posets. Eur. J. Comb. 17(8), 677\u2013687 (1996). https:\/\/doi.org\/10.1006\/EUJC.1996.0059","journal-title":"Eur. J. Comb."},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Ahlswede, R., Cai, N., ZHang, Z.: Erasure, list, and detection zero-error capacities for low noise and a relation to identification. IEEE Trans. Inf. Theory 42(1), 55\u201362 (1996). https:\/\/doi.org\/10.1109\/18.481778","DOI":"10.1109\/18.481778"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/18.605589","volume":"43","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: Correlated sources help transmission over an arbitrarily varying channel. IEEE Trans. Inf. Theory 43(4), 1254\u20131255 (1997). https:\/\/doi.org\/10.1109\/18.605589","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1006\/EUJC.1996.0105","volume":"18","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: General edge-isoperimetric inequalities, part i: information-theoretical methods. Eur. J. Comb. 18(4), 355\u2013372 (1997). https:\/\/doi.org\/10.1006\/EUJC.1996.0105","journal-title":"Eur. J. Comb."},{"issue":"5","key":"19_CR22","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1006\/EUJC.1996.0106","volume":"18","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: General edge-isoperimetric inequalities, part ii: a local-global principle for lexicographical solutions. Eur. J. Comb. 18(5), 479\u2013489 (1997). https:\/\/doi.org\/10.1006\/EUJC.1996.0106","journal-title":"Eur. J. Comb."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/INCO.1997.2629","volume":"135","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: Models of multi-user write-efficient memories and general diametric theorems. Inf. Comput. 135(1), 37\u201367 (1997). https:\/\/doi.org\/10.1006\/INCO.1997.2629","journal-title":"Inf. Comput."},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01196128","volume":"17","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17(1), 11\u201329 (1997). https:\/\/doi.org\/10.1007\/BF01196128","journal-title":"Combinatorica"},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/18.567643","volume":"43","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Cai, N.: On interactive communication. IEEE Trans. Inf. Theory 43(1), 22\u201337 (1997). https:\/\/doi.org\/10.1109\/18.567643","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/18.661504","volume":"44","author":"R Ahlswede","year":"1998","unstructured":"Ahlswede, R., Cai, N.: Information and control: matching channels. IEEE Trans. Inf. Theory 44(2), 542\u2013563 (1998). https:\/\/doi.org\/10.1109\/18.661504","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/18.669303","volume":"44","author":"R Ahlswede","year":"1998","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: Zero-error capacity for models with memory and the enlightened dictator channel. IEEE Trans. Inf. Theory 44(3), 1250\u20131252 (1998). https:\/\/doi.org\/10.1109\/18.669303","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Cai, N.: A counterexample to Kleitman\u2019s conjecture concerning an edge-isoperimetric problem. Comb. Probab. Comput. 8(4), 301\u2013305 (1999). http:\/\/journals.cambridge.org\/action\/displayAbstract?aid=46719","DOI":"10.1017\/S0963548399003909"},{"issue":"2","key":"19_CR29","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/18.749025","volume":"45","author":"R Ahlswede","year":"1999","unstructured":"Ahlswede, R., Cai, N.: Arbitrarily varying multiple-access channels - part ii - correlated senders\u2019 side information, correlated messages, and ambiguous transmission. IEEE Trans. Inf. Theory 45(2), 749\u2013756 (1999). https:\/\/doi.org\/10.1109\/18.749025","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/18.749024","volume":"45","author":"R Ahlswede","year":"1999","unstructured":"Ahlswede, R., Cai, N.: Arbitrarily varying multiple-access channels part i - Ericson\u2019s Symmetrizability is adequate, Gubner\u2019s conjecture is true. IEEE Trans. Inf. Theory 45(2), 742\u2013749 (1999). https:\/\/doi.org\/10.1109\/18.749024","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"19_CR31","doi-asserted-by":"publisher","first-page":"2636","DOI":"10.1109\/18.796419","volume":"45","author":"R Ahlswede","year":"1999","unstructured":"Ahlswede, R., Cai, N.: Identification without randomization. IEEE Trans. Inf. Theory 45(7), 2636\u20132642 (1999). https:\/\/doi.org\/10.1109\/18.796419","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000). https:\/\/doi.org\/10.1109\/18.850663","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1023\/A3A1013823417501","volume":"37","author":"R Ahlswede","year":"2001","unstructured":"Ahlswede, R., Cai, N., Deppe, C.: An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Probl. Inf. Transm. 37(4), 332\u2013338 (2001). https:\/\/doi.org\/10.1023\/A3A1013823417501","journal-title":"Probl. Inf. Transm."},{"issue":"4","key":"19_CR34","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/18.992800","volume":"48","author":"R Ahlswede","year":"2002","unstructured":"Ahlswede, R., Balkenhol, B., Cai, N.: Parallel error correcting codes. IEEE Trans. Inf. Theory 48(4), 959\u2013962 (2002). https:\/\/doi.org\/10.1109\/18.992800","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"19_CR35","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1109\/TIT.2002.800477","volume":"48","author":"R Ahlswede","year":"2002","unstructured":"Ahlswede, R., Cai, N.: Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback. IEEE Trans. Inf. Theory 48(8), 2153\u20132162 (2002). https:\/\/doi.org\/10.1109\/TIT.2002.800477","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Cai, N., Yeung, R.W.: Network coding and error correction. In: Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002, 20\u201325 October 2002, Bangalore, India, pp. 119\u2013122. IEEE (2002). https:\/\/doi.org\/10.1109\/ITW.2002.1115432","DOI":"10.1109\/ITW.2002.1115432"},{"issue":"2","key":"19_CR37","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SY Li","year":"2003","unstructured":"Li, S.Y., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371\u2013381 (2003). https:\/\/doi.org\/10.1109\/TIT.2002.807285","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"19_CR38","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1109\/TIT.2004.828071","volume":"50","author":"R Ahlswede","year":"2004","unstructured":"Ahlswede, R., Cai, N.: On lossless quantum data compression with a classical helper. IEEE Trans. Inf. Theory 50(6), 1208\u20131219 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.828071","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR39","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/S11122-004-0002-2","volume":"40","author":"N Cai","year":"2004","unstructured":"Cai, N., Winter, A., Yeung, R.W.: Quantum privacy and quantum wiretap channels. Probl. Inf. Transm. 40(4), 318\u2013336 (2004). https:\/\/doi.org\/10.1007\/S11122-004-0002-2","journal-title":"Probl. Inf. Transm."},{"key":"19_CR40","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/J.ENDM.2005.07.010","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: A Kraft-type inequality for d-delay binary search codes. Electron. Notes Discret. Math. 21, 133\u2013136 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.010","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR41","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/J.ENDM.2005.07.011","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: A strong converse theorem for quantum multiple access channels. Electron. Notes Discret. Math. 21, 137\u2013141 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.011","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR42","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/J.ENDM.2005.07.012","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: Codes with the identifiable parent property and the multiple-access channel. Electron. Notes Discret. Math. 21, 143\u2013147 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.012","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR43","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/J.ENDM.2005.07.013","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: Search with noisy and delayed response. Electron. Notes Discret. Math. 21, 149\u2013154 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.013","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR44","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/J.ENDM.2005.07.014","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. Electron. Notes Discret. Math. 21, 155\u2013159 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.014","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR45","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/J.ENDM.2005.07.015","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N.: Watermarking identification codes with related topics on common randomness. Electron. Notes Discret. Math. 21, 161\u2013165 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.015","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR46","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/J.ENDM.2005.07.016","volume":"21","author":"R Ahlswede","year":"2005","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: Secrecy systems for identification via channels with additive-like instantaneous block Encipherers. Electron. Notes Discret. Math. 21, 167\u2013168 (2005). https:\/\/doi.org\/10.1016\/J.ENDM.2005.07.016","journal-title":"Electron. Notes Discret. Math."},{"key":"19_CR47","doi-asserted-by":"publisher","unstructured":"Li, S.Y., Yeung, R.W., Cai, N.: On theory of linear network coding. Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4\u20139 September 2005, pp. 273\u2013277. IEEE (2005). https:\/\/doi.org\/10.1109\/ISIT.2005.1523337","DOI":"10.1109\/ISIT.2005.1523337"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Yeung, R.W., Li, S.Y.R., Cai, N., Zhang, Z.: Network coding theory - part i: single source. Found. Trends Commun. Inf. Theory 2(4) (2005). https:\/\/doi.org\/10.1561\/0100000007I","DOI":"10.1561\/0100000007I"},{"key":"19_CR49","doi-asserted-by":"publisher","unstructured":"Yeung, R.W., Li, S.Y.R., Cai, N., Zhang, Z.: Network coding theory - part ii: multiple source. Found. Trends Commun. Inf. Theory 2(5) (2005). https:\/\/doi.org\/10.1561\/0100000007II","DOI":"10.1561\/0100000007II"},{"key":"19_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11889342","volume-title":"General Theory of Information Transfer and Combinatorics","year":"2006","unstructured":"Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.): General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342"},{"key":"19_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/11889342_44","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: A Kraft\u2013type inequality for d\u2013delay binary search codes. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 704\u2013706. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_44"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11889342_26","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: A strong converse theorem for quantum multiple access channels. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 460\u2013485. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_26"},{"issue":"9","key":"19_CR53","doi-asserted-by":"publisher","first-page":"4198","DOI":"10.1109\/TIT.2006.879972","volume":"52","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: An interpretation of identification entropy. IEEE Trans. Inf. Theory 52(9), 4198\u20134207 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.879972","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/11889342_63","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: Appendix: on edge\u2013isoperimetric theorems for uniform hypergraphs. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 979\u20131005. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_63"},{"key":"19_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11889342_12","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: Codes with the identifiable parent property and the multiple-access channel. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 249\u2013257. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_12"},{"key":"19_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/11889342_43","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: Search with noisy and delayed responses. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 695\u2013703. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_43"},{"key":"19_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11889342_13","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 258\u2013275. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_13"},{"key":"19_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11889342_7","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N.: Watermarking identification codes with related topics on common randomness. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 107\u2013153. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_7"},{"key":"19_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11889342_15","volume-title":"General Theory of Information Transfer and Combinatorics","author":"R Ahlswede","year":"2006","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: Secrecy systems for identification via channels with additive-like instantaneous block Encipherer. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 285\u2013292. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_15"},{"key":"19_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1007\/11889342_73","volume-title":"General Theory of Information Transfer and Combinatorics","author":"N Cai","year":"2006","unstructured":"Cai, N.: Private capacity of broadcast channels. In: Ahlswede, R., B\u00e4umer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 1076\u20131078. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889342_73"},{"issue":"6","key":"19_CR61","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1109\/TIT.2006.874965","volume":"52","author":"N Cai","year":"2006","unstructured":"Cai, N., et al.: Introduction to the special issue on networking and information theory. IEEE Trans. Inf. Theory 52(6), 2285\u20132288 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.874965","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR62","doi-asserted-by":"publisher","unstructured":"Cai, N., et al.: Introduction to the special issue on networking and information theory. IEEE\/ACM Trans. Netw. 14(4), 674 (2006). https:\/\/doi.org\/10.1145\/1217646","DOI":"10.1145\/1217646"},{"issue":"1","key":"19_CR63","doi-asserted-by":"publisher","first-page":"19","DOI":"10.4310\/CIS.2006.V6.N1.A2","volume":"6","author":"N Cai","year":"2006","unstructured":"Cai, N., Yeung, R.W.: Network error correction, i: basic concepts and upper bounds. Commun. Inf. Syst. 6(1), 19\u201335 (2006). https:\/\/doi.org\/10.4310\/CIS.2006.V6.N1.A2","journal-title":"Commun. Inf. Syst."},{"issue":"1","key":"19_CR64","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4310\/CIS.2006.V6.N1.A3","volume":"6","author":"N Cai","year":"2006","unstructured":"Cai, N., Yeung, R.W.: Network error correction, ii: lower bounds. Commun. Inf. Syst. 6(1), 37\u201354 (2006). https:\/\/doi.org\/10.4310\/CIS.2006.V6.N1.A3","journal-title":"Commun. Inf. Syst."},{"key":"19_CR65","doi-asserted-by":"publisher","unstructured":"Cai, N., Yeung, R.W.: A security condition for multi- source linear network coding. In: IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 24\u201329 June 2007, pp. 561\u2013565. IEEE (2007). https:\/\/doi.org\/10.1109\/ISIT.2007.4557284","DOI":"10.1109\/ISIT.2007.4557284"},{"key":"19_CR66","doi-asserted-by":"publisher","unstructured":"Yeung, R.W., Cai, N.: On the optimality of a construction of secure network codes. In: Frank, R.K., Yang, E.-H., (eds.) 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6\u201311 July 2008, pp. 166\u2013170. IEEE (2008). https:\/\/doi.org\/10.1109\/ISIT.2008.4594969","DOI":"10.1109\/ISIT.2008.4594969"},{"key":"19_CR67","unstructured":"Chan, T., Cai, N., Grant, A.: Robust key agreement schemes. CoRR abs\/0901.4551 (2009). arXiv: 0901.4551"},{"key":"19_CR68","doi-asserted-by":"publisher","unstructured":"Chan, T., Cai, N., Grant, A.: Robust key agreement schemes. In: IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings, pp. 2106\u20132110. IEEE (2009). https:\/\/doi.org\/10.1109\/ISIT.2009.5205259","DOI":"10.1109\/ISIT.2009.5205259"},{"issue":"2","key":"19_CR69","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/TIT.2008.2008155","volume":"55","author":"RW Yeung","year":"2009","unstructured":"Yeung, R.W., Cai, N., Ho, S.W., Wagner, A.B.: Reliable communication in the absence of a common clock. IEEE Trans. Inf. Theory 55(2), 700\u2013712 (2009). https:\/\/doi.org\/10.1109\/TIT.2008.2008155","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR70","doi-asserted-by":"publisher","unstructured":"Cai, N., Chan, T., Grant, A.: The arbitrarily varying channel when the jammer knows the channel input. In: IEEE International Symposium on Information Theory, ISIT 2010, 13\u201318 June, 2010, Austin, Texas, USA, Proceedings, pp. 295\u2013299. IEEE (2010). https:\/\/doi.org\/10.1109\/ISIT.2010.5513324","DOI":"10.1109\/ISIT.2010.5513324"},{"key":"19_CR71","doi-asserted-by":"publisher","unstructured":"Guo, W., Cai, N.: The minimum decoding delay for convolutional network coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A.8, 1518\u20131523 (2010). https:\/\/doi.org\/10.1587\/TRANSFUN.E93.A.1518","DOI":"10.1587\/TRANSFUN.E93.A.1518"},{"issue":"3","key":"19_CR72","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/JPROC.2010.2094592","volume":"99","author":"N Cai","year":"2011","unstructured":"Cai, N., Chan, T.: Theory of secure network coding. Proc. IEEE 99(3), 421\u2013437 (2011). https:\/\/doi.org\/10.1109\/JPROC.2010.2094592","journal-title":"Proc. IEEE"},{"issue":"1","key":"19_CR73","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TIT.2010.2090197","volume":"57","author":"N Cai","year":"2011","unstructured":"Cai, N., Yeung, R.W.: Secure network coding on a wiretap network. IEEE Trans. Inf. Theory 57(1), 424\u2013435 (2011). https:\/\/doi.org\/10.1109\/TIT.2010.2090197","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR74","unstructured":"Guo, W., Cai, N., Shi, X., Medard, M.: Localized dimension growth in random network coding: a convolutional approach. CoRR abs\/1103.6258 (2011). arXiv: 1103.6258"},{"key":"19_CR75","doi-asserted-by":"publisher","unstructured":"Guo, W., Cai, N., Shi, X., Medard, M.: Localized dimension growth in random network coding: a convolutional approach. In: Kuleshov, A., Blinovsky, V.M., Ephremides, A., (eds.) 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5 2011, pp. 1156\u20131160. IEEE (2011). https:\/\/doi.org\/10.1109\/ISIT.2011.6033714","DOI":"10.1109\/ISIT.2011.6033714"},{"key":"19_CR76","unstructured":"Guo, W., Cai, N., Sun, Q.T.: Convolutional network coding based on matrix power series representation. CoRR abs\/1109.3095 (2011). arXiv: 1109.3095"},{"key":"19_CR77","unstructured":"Liu, B., Cai, N.: Analog network coding in the generalized high-SNR regime. CoRR abs\/1106.3627 (2011). arXiv: 1106.3627"},{"key":"19_CR78","doi-asserted-by":"publisher","unstructured":"Liu, B., Cai, N.: Analog network coding in the generalized high- SNR regime. In: Kuleshov, A., Blinovsky, V.M., Ephremides, A., (eds.) 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31\u2013August 5 2011, pp. 74\u201378. IEEE (2011). https:\/\/doi.org\/10.1109\/ISIT.2011.6034234","DOI":"10.1109\/ISIT.2011.6034234"},{"issue":"1","key":"19_CR79","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/TIT.2010.2090216","volume":"57","author":"M Tan","year":"2011","unstructured":"Tan, M., Yeung, R.W., Ho, S.T., Cai, N.: A unified framework for linear network coding. IEEE Trans. Inf. Theory 57(1), 416\u2013423 (2011). https:\/\/doi.org\/10.1109\/TIT.2010.2090216","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR80","doi-asserted-by":"publisher","unstructured":"Cai, M., Cai, N., Deppe, C.: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. In: Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, 1\u20136 July 2012, pp. 726\u2013730. IEEE (2012). https:\/\/doi.org\/10.1109\/ISIT.2012.6284548","DOI":"10.1109\/ISIT.2012.6284548"},{"key":"19_CR81","doi-asserted-by":"crossref","unstructured":"Cai, M., Cai, N., Deppe, C.: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. CoRR abs\/1202.0773 (2012). arXiv: 1202.0773","DOI":"10.1109\/ISIT.2012.6284548"},{"issue":"10","key":"19_CR82","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1109\/LCOMM.2012.080312.120789","volume":"16","author":"W Guo","year":"2012","unstructured":"Guo, W., Cai, N., Sun, Q.T.: Time-variant decoding of convolutional network codes. IEEE Commun. Lett. 16(10), 1656\u20131659 (2012). https:\/\/doi.org\/10.1109\/LCOMM.2012.080312.120789","journal-title":"IEEE Commun. Lett."},{"key":"19_CR83","unstructured":"Liu, B., Cai, N.: Multi-hop analog network coding: an amplify-and-forward approach. CoRR abs\/1203.4867 (2012). arXiv: 1203.4867"},{"key":"19_CR84","doi-asserted-by":"publisher","unstructured":"Ahlswede, R., Cai, N.: Cross-disjoint pairs of clouds in the interval lattice. In: Ronald, L.G., Jaroslav, N., Steve, B., (eds.) The Mathematics of Paul Erd\u0151s I, pp. 107\u2013117. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4614-7258-2_8","DOI":"10.1007\/978-1-4614-7258-2_8"},{"key":"19_CR85","unstructured":"Boche, H., Cai, M., Cai, N., Deppe, C.: Secrecy capacities of compound quantum wiretap channels and applications. CoRR abs\/1302.3412 (2013). arXiv: 1302.3412"},{"issue":"9","key":"19_CR86","doi-asserted-by":"publisher","first-page":"3894","DOI":"10.1109\/TCOMM.2013.071013.120857","volume":"61","author":"W Guo","year":"2013","unstructured":"Guo, W., Shi, X., Cai, N., Medard, M.: Localized dimension growth: a convolutional random network coding approach to managing memory and decoding delay. IEEE Trans. Commun. 61(9), 3894\u20133905 (2013). https:\/\/doi.org\/10.1109\/TCOMM.2013.071013.120857","journal-title":"IEEE Trans. Commun."},{"key":"19_CR87","unstructured":"Guo, W., Shi, X., Cai, N., Medard, M.: Localized dimension growth: a convolutional random network coding approach to managing memory and decoding delay. CoRR abs\/1303.4484 (2013). arXiv: 1303.4484"},{"key":"19_CR88","doi-asserted-by":"publisher","unstructured":"Liu, B., Cai, N.: Optimal rate region of two-hop multiple access channel via amplify-and-forward scheme. In: Harout, K.A., Ferdinando, C., Christian, D., (eds.) Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science, vol. 7777, pp. 44\u201370. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-36899-8_3","DOI":"10.1007\/978-3-642-36899-8_3"},{"issue":"3","key":"19_CR89","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.3390\/E16031211","volume":"16","author":"N Cai","year":"2014","unstructured":"Cai, N.: The maximum error probability criterion, random encoder, and feedback, in multiple input channels. Entropy 16(3), 1211\u20131242 (2014). https:\/\/doi.org\/10.3390\/E16031211","journal-title":"Entropy"},{"key":"19_CR90","doi-asserted-by":"publisher","unstructured":"Chen, Y., Cai, N., Sezgin, A.: Wiretap channel with correlated sources. In: 2014 IEEE International Conference on Cloud Engineering, Boston, MA, USA, 11\u201314 March 2014, pp. 472\u2013477. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/IC2E.2014.80","DOI":"10.1109\/IC2E.2014.80"},{"issue":"11","key":"19_CR91","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1049\/IET-COM.2013.1150","volume":"8","author":"B Liu","year":"2014","unstructured":"Liu, B., Cai, N.: Design of amplify-and-forward relaying schemes for layered relay networks. IET Commun. 8(11), 1910\u20131918 (2014). https:\/\/doi.org\/10.1049\/IET-COM.2013.1150","journal-title":"IET Commun."},{"issue":"9","key":"19_CR92","doi-asserted-by":"publisher","first-page":"6462","DOI":"10.3390\/E17096462","volume":"17","author":"F Cai","year":"2015","unstructured":"Cai, F., Cai, N., Guo, W.: Subspace coding for networks with different level messages. Entropy 17(9), 6462\u20136480 (2015). https:\/\/doi.org\/10.3390\/E17096462","journal-title":"Entropy"},{"key":"19_CR93","doi-asserted-by":"publisher","unstructured":"Cao, Q., Cai, N., Guo, W.: Zero-error capacity of binary channels with 1-memory. In: IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, 14\u201319 June 2015, pp. 1317\u20131321. IEEE (2015). https:\/\/doi.org\/10.1109\/ISIT.2015.7282669","DOI":"10.1109\/ISIT.2015.7282669"},{"key":"19_CR94","doi-asserted-by":"publisher","unstructured":"Boche, H., Cai, N., Noetzel, J.: Classical-quantum channels with causal and non-causal channel state information at the sender. In: IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10\u201315 July 2016, pp. 2049\u20132053. IEEE (2016). https:\/\/doi.org\/10.1109\/ISIT.2016.7541659","DOI":"10.1109\/ISIT.2016.7541659"},{"key":"19_CR95","doi-asserted-by":"crossref","unstructured":"Boche, H., Cai, N., Noetzel, J.: Classical-quantum channels with causal and non-causal channel state information at the sender. In: IEEE International Symposium on Information Theory (ISIT), pp. 2049\u20132053. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541659"},{"issue":"19","key":"19_CR96","doi-asserted-by":"publisher","first-page":"195302","DOI":"10.1088\/1751-8113\/49\/19\/195302","volume":"49","author":"H Boche","year":"2016","unstructured":"Boche, H., Cai, N., Notzel, J.: The classical-quantum channel with random state parameters known to the sender. J. Phys. A: Math. Theor. 49(19), 195302 (2016)","journal-title":"J. Phys. A: Math. Theor."},{"issue":"11","key":"19_CR97","doi-asserted-by":"publisher","first-page":"6095","DOI":"10.1109\/TIT.2016.2608900","volume":"62","author":"N Cai","year":"2016","unstructured":"Cai, N.: List decoding for arbitrarily varying multiple access channel revisited: list configuration and symmetrizability. IEEE Trans. Inf. Theory 62(11), 6095\u20136110 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2608900","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR98","doi-asserted-by":"publisher","unstructured":"He, D., Luo, Y., Cai, N.: Strong secrecy capacity of the wiretap channel II with DMC main channel. In: IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10\u201315 July 2016, pp. 505\u2013509. IEEE (2016). https:\/\/doi.org\/10.1109\/ISIT.2016.7541350","DOI":"10.1109\/ISIT.2016.7541350"},{"key":"19_CR99","unstructured":"Cai, N., Hayashi, M.: Secure Network code for adaptive and active attacks with no-randomness in intermediate nodes. CoRR abs\/1712.09035 (2017). arXiv: 1712.09035"},{"key":"19_CR100","unstructured":"Hayashi, M., Owari, M., Kato, G., Cai, N.: Secrecy and robustness for active attack in secure network coding. CoRR abs\/1703.00723 (2017). arXiv: 1703.00723"},{"key":"19_CR101","doi-asserted-by":"publisher","unstructured":"Hayashi, M., Owari, M., Kato, G., Cai, N.: Secrecy and robustness for active attack in secure network coding. In: 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25\u201330 June 2017, pp. 1172\u20131176. IEEE (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8006713","DOI":"10.1109\/ISIT.2017.8006713"},{"key":"19_CR102","doi-asserted-by":"publisher","unstructured":"Boche, H., Cai, M., Cai, N.: Message transmission over classical quantum channels with a jammer with side information. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 2017\u20132021. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437767","DOI":"10.1109\/ISIT.2018.8437767"},{"key":"19_CR103","unstructured":"Boche, H., Cai, M., Cai, N.: Message transmission over classical quantum channels with a jammer with side information: message transmission capacity and resources. CoRR abs\/1801.10550 (2018). arXiv: 1801.10550"},{"issue":"10","key":"19_CR104","doi-asserted-by":"publisher","first-page":"6771","DOI":"10.1109\/TIT.2018.2830362","volume":"64","author":"Q Cao","year":"2018","unstructured":"Cao, Q., Cai, N., Guo, W., Yeung, R.W.: On zero- error capacity of binary channels with one memory. IEEE Trans. Inf. Theory 64(10), 6771\u20136778 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2830362","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR105","doi-asserted-by":"publisher","unstructured":"Guo, W., He, D., Cai, N.: Network error correction coding for time-varying adversarial errors in a unicast network. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 836\u2013840. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437833","DOI":"10.1109\/ISIT.2018.8437833"},{"issue":"4","key":"19_CR106","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/LCOMM.2018.2795598","volume":"22","author":"W Guo","year":"2018","unstructured":"Guo, W., He, D., Cai, N.: On capacity of network error correction coding with random errors. IEEE Commun. Lett. 22(4), 696\u2013699 (2018). https:\/\/doi.org\/10.1109\/LCOMM.2018.2795598","journal-title":"IEEE Commun. Lett."},{"key":"19_CR107","doi-asserted-by":"crossref","unstructured":"Baur, S., Boche, H., Cai, N.: Secret key generation from a biometric source with an eavesdropping jammer. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/INFOCOMWKSHPS47286.2019.9093770"},{"key":"19_CR108","doi-asserted-by":"publisher","unstructured":"Baur, S., Cai, N., Wiese, M., Boche, H.: Secret key generation from a two component compound source with rate constrained one way communication: perfect secrecy. In: IEEE International Workshop on Information Forensics and Security, WIFS 2019, Delft, The Netherlands, December 9\u201312 2019, pp. 1\u20136. IEEE (2019). https:\/\/doi.org\/10.1109\/WIFS47025.2019.9035091","DOI":"10.1109\/WIFS47025.2019.9035091"},{"key":"19_CR109","doi-asserted-by":"publisher","unstructured":"Boche, H., Cai, M., Cai, N.: Message transmission over classical quantum channels with a jammer with side information, correlation as resource and common randomness generating. In: IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12 2019 pp. 1722\u20131726. IEEE (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849329","DOI":"10.1109\/ISIT.2019.8849329"},{"issue":"5","key":"19_CR110","doi-asserted-by":"publisher","first-page":"2922","DOI":"10.1109\/TIT.2018.2878209","volume":"65","author":"H Boche","year":"2019","unstructured":"Boche, H., Cai, M., Cai, N.: Message transmission over classical quantum channels with a jammer with side information: message transmission capacity and resources. IEEE Trans. Inf. Theory 65(5), 2922\u20132943 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2878209","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"19_CR111","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TCOMM.2018.2885785","volume":"67","author":"W Guo","year":"2019","unstructured":"Guo, W., He, D., Cai, N.: Some results on network error correction with time-varying adversarial errors. IEEE Trans. Commun. 67(3), 1797\u20131808 (2019). https:\/\/doi.org\/10.1109\/TCOMM.2018.2885785","journal-title":"IEEE Trans. Commun."},{"key":"19_CR112","doi-asserted-by":"crossref","unstructured":"Boche, H., Cai, M., Cai, N.: message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation. J. Math. Phys. 61(6) (2020)","DOI":"10.1063\/1.5092179"},{"issue":"6","key":"19_CR113","doi-asserted-by":"publisher","first-page":"3954","DOI":"10.1109\/TIT.2020.2979957","volume":"66","author":"N Cai","year":"2020","unstructured":"Cai, N., Hayashi, M.: Corrections to secure network code for adaptive and active attacks with no-randomness in intermediate nodes. IEEE Trans. Inf. Theory 66(6), 3954 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.2979957","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"19_CR114","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1109\/TIT.2019.2957078","volume":"66","author":"N Cai","year":"2020","unstructured":"Cai, N., Hayashi, M.: Secure network code for adaptive and active attacks with no-randomness in intermediate nodes. IEEE Trans. Inf. Theory 66(3), 1428\u20131448 (2020). https:\/\/doi.org\/10.1109\/TIT.2019.2957078","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR115","unstructured":"Hayashi, M., Cai, N.: Asymptotically secure network code for active attacks and its application to network quantum key distribution. CoRR abs\/2003.12225 (2020). arXiv: 2003.12225"},{"key":"19_CR116","unstructured":"Hayashi, M., Cai, N.: Secure network code over one-hop relay network. CoRR abs\/2003.12223 (2020). arxiv:2003.12223"},{"key":"19_CR117","unstructured":"Hayashi, M., Cai, N.: Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding. CoRR abs\/2011.00410 (2020). arXiv: 2011.00410"},{"issue":"9","key":"19_CR118","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.3390\/E22091053","volume":"22","author":"M Hayashi","year":"2020","unstructured":"Hayashi, M., Owari, M., Kato, G., Cai, N.: Reduction theorem for secrecy over linear network code for active attacks. Entropy 22(9), 1053 (2020). https:\/\/doi.org\/10.3390\/E22091053","journal-title":"Entropy"},{"key":"19_CR119","unstructured":"Hayashi, M., Owari, M., Kato, G., Cai, N.: Reduction theorem for secrecy over linear network code for active attacks. CoRR abs\/2003.11722 (2020). arXiv: 2003.11722"},{"issue":"2","key":"19_CR120","doi-asserted-by":"publisher","first-page":"222","DOI":"10.3390\/E22020222","volume":"22","author":"H Li","year":"2020","unstructured":"Li, H., Cai, N.: Computing classical-quantum channel capacity using Blahut-Arimoto type algorithm: a theoretical and numerical analysis. Entropy 22(2), 222 (2020). https:\/\/doi.org\/10.3390\/E22020222","journal-title":"Entropy"},{"issue":"5","key":"19_CR121","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.1109\/TCOMM.2021.3057112","volume":"69","author":"M Hayashi","year":"2021","unstructured":"Hayashi, M., Cai, N.: Asymptotically secure network code for active attacks. IEEE Trans. Commun. 69(5), 3245\u20133259 (2021). https:\/\/doi.org\/10.1109\/TCOMM.2021.3057112","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"19_CR122","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/JSAIT.2021.3053697","volume":"2","author":"M Hayashi","year":"2021","unstructured":"Hayashi, M., Cai, N.: Secure non-linear network code over a one-hop relay network. IEEE J. Sel. Areas Inf. Theory 2(1), 296\u2013305 (2021). https:\/\/doi.org\/10.1109\/JSAIT.2021.3053697","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"19_CR123","doi-asserted-by":"publisher","unstructured":"Hayashi, M., Cai, N.: Universal classical-quantum multiple access channel coding. In: IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20 2021, pp. 402\u2013407. IEEE (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517859","DOI":"10.1109\/ISIT45174.2021.9517859"},{"key":"19_CR124","doi-asserted-by":"publisher","unstructured":"Hayashi, M., Cai, N.: Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding. IEEE Trans. Inf. Theory 68(3), 1522\u20131850 (2022). https:\/\/doi.org\/10.1109\/TIT.2021.3131575","DOI":"10.1109\/TIT.2021.3131575"}],"container-title":["Lecture Notes in Computer Science","Information Theory and Related Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82014-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T10:53:44Z","timestamp":1744887224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82014-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031820137","9783031820144"],"references-count":124,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82014-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}