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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
