Skip to main content
Log in

Abstract

It has been proposed that syntactical information be used as an aid in error detection, location, and correction. In the present paper the minimum distance syntactical decoding algorithm of Souza and Scholtz is improved with the use of sequential decoding techniques. Fano's algorithm is adapted to the syntactical case; simulation results show the drastic reduction in number of backtrackings afforded by the new algorithm. Comments are made on the results obtained, their implications, and topics for future research.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Ash,Information Theory (Wiley, New York, 1965).

    Google Scholar 

  2. C. R. Souza and R. A. Sholtz, “Syntactical decoders and backtrackings S-grammars,” The Aloha System Techn. Report A69-9, University of Hawaii, Honolulu (November 1969), 33 pp.

    Google Scholar 

  3. R. G. Gallager,Information Theory and Reliable Communication (Wiley, New York, 1968), 588 pp.

    Google Scholar 

  4. C. R. Souza and R. A. Sholtz, “Probabilistic generation, transmission and syntactical decoding of context-free languages,” inProc. 8th Allerton Conf. on Circuit and System Theory (Monticello, Illinois, October 1970).

    Google Scholar 

  5. S. A. Greibach, “A new normal form theorem for context-free phrase structure grammars,”JACM 13(4):582–587 (1965).

    Google Scholar 

  6. D. J. Rosenkrantz, “Programmed grammars—a new device for generating formal languages,”IEEE Conf. Rec., 8th Annual Symp. on Switching and Automata Theory (1967), pp. 529–544.

  7. C. R. Souza, “Probabilisties in context-free programmed grammars,” The Aloha System Report A70-2, University of Hawaii, Honolulu, (March 1970), 48 pp.

    Google Scholar 

  8. C. R. Souza, “Discrete stochastic models and formal languages,” in5th Asilomar Conf. on Circuits and Systems (Pacific Grove, California, November 1971).

    Google Scholar 

  9. P. Dierks, “On the distance properties of finite state languages with application to error correction,” Ph.D. Thesis, Department of Electical Engineering, Notre Dame, Indiana (May 1971).

    Google Scholar 

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

    Google Scholar 

  11. F. Jelinek, “A fast sequential decoding algorithm using a stack,”IBM J. Res. Dev. 13:675–685 (1969).

    Google Scholar 

  12. K. Sh. Zigangirov, “Some sequential decoding procedures,”Probl. Peredach. Inform. 2:13–25 (1966).

    Google Scholar 

  13. J. L. Massey, “Variable-length codes and the Fano metric,”IEEE Trans, on Info. Theory IT-18(1) (1972).

Download references

Author information

Authors and Affiliations

Authors

Additional information

The present research was supported in part by BNDE, the Brazilian Bank for National Development.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Velasco, F.R.D., Souza, C.d.R.e. Sequential syntactical decoding. International Journal of Computer and Information Sciences 3, 273–287 (1974). https://doi.org/10.1007/BF00978976

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation