Basic Orchard Algorithm

Let i be the index of initial guess codeword;

r := ||ci - q||;

best-index := i;

j := 1;

while A[i,j].distance < 2 * r do

if ||cj - q|| < r then best-index := j;

j := j + 1;

This algorithm searches all the codewords within a distance

2r of the guess codeword.

Previous slide

Next slide

Back to first slide

View graphic version