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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
R. Ash,Information Theory (Wiley, New York, 1965).
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.
R. G. Gallager,Information Theory and Reliable Communication (Wiley, New York, 1968), 588 pp.
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).
S. A. Greibach, “A new normal form theorem for context-free phrase structure grammars,”JACM 13(4):582–587 (1965).
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.
C. R. Souza, “Probabilisties in context-free programmed grammars,” The Aloha System Report A70-2, University of Hawaii, Honolulu, (March 1970), 48 pp.
C. R. Souza, “Discrete stochastic models and formal languages,” in5th Asilomar Conf. on Circuits and Systems (Pacific Grove, California, November 1971).
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).
D. Gries,Compiler Construction for Digital Computers (Wiley, New York, 1971).
F. Jelinek, “A fast sequential decoding algorithm using a stack,”IBM J. Res. Dev. 13:675–685 (1969).
K. Sh. Zigangirov, “Some sequential decoding procedures,”Probl. Peredach. Inform. 2:13–25 (1966).
J. L. Massey, “Variable-length codes and the Fano metric,”IEEE Trans, on Info. Theory IT-18(1) (1972).
Author information
Authors and Affiliations
Additional information
The present research was supported in part by BNDE, the Brazilian Bank for National Development.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00978976