Skip to main content
SpringerLink
Log in

An error-correcting syntactic decoder for computer networks

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

An information source that generates messages with formal syntactic structures is proposed. It is modeled as a context-free grammar in Chomsky Normal Form. The messages are binary coded with or without error-correction capabilities, and are transmitted over a memoryless symmetric noisy channel. At the receiver, an algorithmic procedure is proposed for the correction of syntactic errors in the incoming messages. This is similar to the Cocke-Younger-Kasami parser with the additional capability of detecting and correcting syntactic errors in the input strings. Simulation results are presented which show that the present syntactic decoding scheme has a lower probability of decoding errors than conventional algebraic decoding schemes. Its performance is also compared with that of an alternate syntactic decoder studied recently.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Abramson, “The ALOHA system,” inComputer-Communication Networks, N. Abramson and F. F. Kuo, eds. (Prentice-Hall, 1973).

  2. L. W. Fung and K. S. Fu, “Communication of languages using syntactic information,” regular paper, inInt. Symposium on Information Theory, October 1974, Notre Dame, Indiana.

  3. D. Gries,Compiler Construction for Digital Computers (Wiley, New York, 1971).

    Google Scholar 

  4. B. A. Galler and A. I. Perlis,A View of Programming Languages (Addison Wesley, 1970).

  5. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, 1969).

  6. E. T. Irons, “An error-correcting parse algorithm,”Comm. ACM 6(11)(1963).

  7. F. Jelinek,Probabilistic Information Theory (McGraw-Hill, New York, 1968).

    Google Scholar 

  8. Jean-Pierre Levy, “Automatic correction of syntax errors in programming languages,” Ph.D. Thesis, Computer Science Dept., Cornell University (1971).

  9. R. W. Lucky, “Common-carrier data communication,” inComputer-Communication Networks, N. Abramson and F. F. Kuo, eds. (Prentice-Hall, 1973).

  10. G. Lyon, “Syntax-directed least-errors analysis for context-free languages: a practical approach,”Comm. ACM 17(1)(1974).

  11. W. B. Smith, “Error detection in formal languages,”J. Computer and System Sciences 4:385–405 (1970).

    Google Scholar 

  12. C. R. Souza and R. A. Scholtz, “Probabilistic generation, transmissions and syntactical decoding of context-free programmed languages,” inProceedings Eight Annual Allerton Conf. on Circuit and System Theory (Allerton House, Monticello, Illinois, October 1970).

    Google Scholar 

  13. Celso de Renna e Souza and R. A. Scholtz, “Syntactical decoders and backtrackingS-grammars,” Report A69-9,The ALOHA System, University of Hawaii, Honolulu, Hawaii (1969).

    Google Scholar 

  14. F. R. D. Velasco and C. R. Souza, “Sequential syntactical decoding,” in1973 IEEE International Symposium on Information Theory, King Saul Hotel, Ashkelon, Israel, June1973.

    Google Scholar 

  15. A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation and Compiling, Vol. 1 (Prentice-Hall, 1972).

  16. D. H. Younger, “Recognition and parsing of CFLs in Timen 3,”Information and Control 10(2):189–208 (1967).

    Google Scholar 

  17. G. E. Lyon, “Least-errors recognition of mutated context-free sentences in Timen 3 logn,” inProc., Sixth Princeton Conf. on Inf. Systems and Sci., Princeton, N.J. 1972, pp. 115–118.

  18. R. Teitelbaum, “Context-free error analysis by evaluation of algebraic power series,” inProc., ACM-SIGACT Fifth Ann. Conf. on Theory of Computing, Univ. of Texas,Austin 1973, pp. 196–199.

  19. J. E. Hopcroft and J. D. Ullman, “Error correction for formal languages,” Digital Systems Lab Report 52, Princeton University (1966).

  20. L. W. Fung and K. S. Fu, “Maximum-likelihood syntactic decoding,”IEEE Trans. Information Theory (July 1975).

  21. L. G. Valiant, “General context-free recognition in less than cubic time,” Dept. of Computer Science, Carnegie-Mellon University (January 1974).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Tennessee, Knoxville, Tennessee

    L. W. Fung

  2. School of Electrical Engineering, Purdue University, West Lafayette, Indiana

    K. S. Fu

Authors
  1. L. W. Fung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. S. Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the National Science Foundation under grant ENG 74-17586.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fung, L.W., Fu, K.S. An error-correcting syntactic decoder for computer networks. International Journal of Computer and Information Sciences 5, 45–58 (1976). https://doi.org/10.1007/BF00991071

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00991071

Key words

Search

Navigation