共 50 条
- [1] Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1576 - 1580
- [2] Explicit Low-complexity Codes for Multiple Access Channel Resolvability [J]. 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 116 - 123
- [3] Low-Complexity Channel Resolvability Codes for the Symmetric Multiple-Access Channel [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 466 - 470
- [4] Multiple-Access Channel Resolvability with Cribbing [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
- [6] Channel Resolvability Codes Based on Concatenation and Sparse Linear Encoding [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2111 - 2115
- [8] Resolvability of the Multiple Access Channel with Two-Sided Cooperation [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 990 - 994
- [9] Strong Secrecy From Channel Resolvability [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 8077 - 8098
- [10] On Channel Resolvability in Presence of Feedback [J]. 2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2016, : 78 - 85