Decoding delays of orchard codes

J. Lee, Akira Shiozaki · IEE Proceedings I Communications Speech and Vision · 1992

To evaluate an orchard code, a standard measure of how well the orchard code works is necessary. In the paper we propose the decoding delay to replace the commonly used scheme length as a criterion for evaluating orchard codes. The ever approachable lower bound of the decoding delay is derived to be 2τ for τ-error correcting orchard codes. With the help of the concept of the decoding delay, the performances of several orchard codes are compared. Also given are some very interesting new orchard codes.

Read the paper · More papers on PaperTik