A simple necessary and sufficient condition for the existence of robust communication protocols for arbitrary alphabets and a large class of transmission errors is presented. This class of errors, called transformation errors, consists of those errors where symbols (messages) may be lost or corrupted to other symbols. The proof is used as the basis of a procedure for automatically constructing robust protocols for transformation errors. The protocols generated are small in size, despite not being custom-designed. The results presented generalize and expand upon those of Aho et al. [AUY79]. Two protocols are constructed to illustrate our technique, and are contrasted with those of Aho et al.
|Title of host publication
|Foundations of Software Technology and Theoretical Computer Science - 4th Conference, Proceedings
|Mathai Joseph, Rudrapatna Shyamasundar
|Number of pages
|Published - 1984
|4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984 - Bangalore, India
Duration: 13 Dec 1984 → 15 Dec 1984
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|4th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1984
|13/12/84 → 15/12/84
Bibliographical notePublisher Copyright:
© 1984, Springer-Verlag.