Decoding delays of orchard codes

To evaluate an orchard code, a standard measure of how well the orchard code works is necessary. The authors 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 tau for tau -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.<>