Communication with partial noisy feedback
Title | Communication with partial noisy feedback |
Publication Type | Conference Paper |
Year of Publication | 2017 |
Authors | Wang, G., Qin, Yanyuan, Chang, Chengjuan |
Conference Name | 2017 IEEE Symposium on Computers and Communications (ISCC) |
ISBN Number | 978-1-5386-1629-1 |
Keywords | alphabet-based encoding, channel coding, Computers, encoding, error correction, error correction codes, error detection codes, error-correction, error-detection, forward error correction, maximum error rate, Noise measurement, Non-Malleable Codes, one-way communication, partial noisy feedback, Protocols, pubcrawl, Resiliency, Scalability, security |
Abstract | 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 d 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 d (0 d 1), under the MER rate, so that Alice can successfully communicate the messages to Bob via some protocols with d 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 d (0; 1), there exists a deterministic communication scheme with noiseless full feedback(d = 1), such that the maximal tolerable error fraction g (on Alice's transmissions) can be up to 1/2, theoretically. Moreover, we show that for any d (0; 1), there exists a communication scheme with noisy feedback, denoting the forward and backward rounds noised with error fractions of g0and g1respectively, such that the maximal tolerable error fraction g0(on forward rounds) can be up to 1/2, as well as the g1(on feedback rounds) up to 1. |
URL | https://ieeexplore.ieee.org/document/8024594 |
DOI | 10.1109/ISCC.2017.8024594 |
Citation Key | wang_communication_2017 |
- maximum error rate
- security
- Scalability
- Resiliency
- pubcrawl
- Protocols
- partial noisy feedback
- one-way communication
- Non-Malleable Codes
- Noise measurement
- alphabet-based encoding
- forward error correction
- error-detection
- error-correction
- error detection codes
- error correction codes
- error correction
- encoding
- Computers
- channel coding