Orchard Data Structure

6

5

4

2

3

8

7

3

6

7

5

8

1

4

5

2

7

8

6

4

1

1

1

2

3

4

5

6

7

8

• For each codeword sort the other codewords by distance to the codeword.

2

3

.

.

.

index

distance

A[1..8,1..7]

Previous slide

Next slide

Back to first slide

View graphic version