Communication with partial noisy feedback

This paper introduces the notion of one-way communication schemes with partial noisy feedback. To support this communication, the schemes suppose that Alice and Bob wish to communicate: Alice sends a sequence of alphabets over a channel to Bob, while Alice receives feedback bits from Bob for δ fraction of the transmissions. An adversary is allowed to tamper up to a constant fraction of these transmissions for both forward rounds and feedback rounds separately. This paper intends to determine the Maximum Error Rate (MER), as a function of δ (0 ≤ δ ≤ 1), under the MER rate, so that Alice can successfully communicate the messages to Bob via some protocols with δ fraction of noisy feedback. To provide a reasonable solution for the above problem, we need to explore a new kind of coding scheme for the interactive communication. In this paper, we use the notion of “non-malleable codes” (NMC) which relaxes the notions of error-correction and error-detection to some extent in communication. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message or a completely unrelated value. This property largely enforces the way to detect the transmission errors. Based on the above knowledge, we provide an alphabet-based encoding scheme, including a pair of (Enc, Dec). Suppose the message needing to be transmitted is m; if m is corrupted unintentionally, then the encoding scheme Dec(Enc(m)) outputs a symbol ‘⊥’ to denote that some potential corruptions happened during transmission. In this work, based on the previous results, we show that for any δ ∈ (0; 1), there exists a deterministic communication scheme with noiseless full feedback(δ = 1), such that the maximal tolerable error fraction γ (on Alice's transmissions) can be up to 1/2, theoretically. Moreover, we show that for any δ ∈ (0; 1), there exists a communication scheme with noisy feedback, denoting the forward and backward rounds noised with error fractions of γ0 and γ1 respectively, such that the maximal tolerable error fraction γ0 (on forward rounds) can be up to 1/2, as well as the γ1 (on feedback rounds) up to 1.

[1]  Xianbin Wang,et al.  Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks , 2013, IEEE Transactions on Communications.

[2]  Robert S. Schriebman Error Correcting Code , 2006 .

[3]  E. Gilbert A comparison of signalling alphabets , 1952 .

[4]  Yu Gong,et al.  Dual Antenna Selection in Secure Cognitive Radio Networks , 2016, IEEE Transactions on Vehicular Technology.

[5]  Michele Nogueira Lima,et al.  Identity-based key management in mobile ad hoc networks: techniques and applications , 2008, IEEE Wireless Communications.

[6]  Massimo Franceschetti,et al.  Wiretap Channel With Secure Rate-Limited Feedback , 2009, IEEE Transactions on Information Theory.

[7]  Lifeng Wang,et al.  Safeguarding 5G wireless communication networks using physical layer security , 2015, IEEE Communications Magazine.

[8]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[9]  Gang Wang,et al.  A novel MAC protocol for wireless network using multi-beam directional antennas , 2017, 2017 International Conference on Computing, Networking and Communications (ICNC).

[10]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[11]  Amit Sahai,et al.  Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.

[12]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[13]  Gregory W. Wornell,et al.  Secure Broadcasting Over Fading Channels , 2008, IEEE Transactions on Information Theory.

[14]  Peter Winkler,et al.  Three Thresholds for a Liar , 1992, Combinatorics, Probability and Computing.

[15]  Hyungsik Ju,et al.  Improving efficiency of resource usage in two-hop full duplex relay systems based on resource sharing and interference cancellation , 2009, IEEE Transactions on Wireless Communications.

[16]  Taneli Riihonen,et al.  Optimized gain control for single-frequency relaying with loop interference , 2009, IEEE Transactions on Wireless Communications.

[17]  Yu Gong,et al.  Physical Layer Network Security in the Full-Duplex Relay System , 2015, IEEE Transactions on Information Forensics and Security.

[18]  Stefan Dziembowski,et al.  Non-Malleable Codes , 2018, ICS.

[19]  E. Berlekamp Block coding with noiseless feedback , 1964 .

[20]  J.H. Reed,et al.  Antenna Isolation, Wideband Multipath Propagation Measurements, and Interference Mitigation for On-frequency Repeaters , 2004, IEEE SoutheastCon, 2004. Proceedings..

[21]  Zhi Chen,et al.  Max-Ratio Relay Selection in Secure Buffer-Aided Cooperative Wireless Networks , 2014, IEEE Transactions on Information Forensics and Security.

[22]  Tsachy Weissman,et al.  The Gaussian Channel with Noisy Feedback , 2007, 2007 IEEE International Symposium on Information Theory.

[23]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[24]  S. M. Lee,et al.  Secure communication based on chaotic synchronization via interval time-varying delay feedback control , 2011 .

[25]  Ameya Velingker,et al.  Communication with Partial Noiseless Feedback , 2015, APPROX-RANDOM.

[26]  Klim Efremenko,et al.  Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback , 2016, IEEE Trans. Inf. Theory.

[27]  Yu Gong,et al.  Study of Relay Selection in a Multi-Cell Cognitive Network , 2013, IEEE Wireless Communications Letters.

[28]  Saeedeh Parsaeefard,et al.  Cooperative Secure Resource Allocation in Cognitive Radio Networks with Guaranteed Secrecy Rate for Primary Users , 2014, IEEE Transactions on Wireless Communications.

[29]  Andrea J. Goldsmith,et al.  Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective , 2009, Proceedings of the IEEE.

[30]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.