From 1ee80e30b89c54ef65cedf7202599db8d0b2b078 Mon Sep 17 00:00:00 2001 From: "Steinar H. Gunderson" Date: Wed, 1 Mar 2006 23:43:55 +0000 Subject: [PATCH] Added a note about how the transposition table works. --- hamming.c | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/hamming.c b/hamming.c index 0371458..215b1dd 100644 --- a/hamming.c +++ b/hamming.c @@ -9,7 +9,8 @@ unsigned char hamming_lookup[NUM_DATA_WORDS]; /* * Needed since we store all the parity at the end of the word, not at the expected - * power-of-two bit positions. + * power-of-two bit positions. This is the inverse of the mapping + * (0..15) -> (0, 8, 4, 2, 1, the rest in ascending order) */ unsigned char permutation_table[CODE_BITS] = { 0, 4, 3, 5, 2, 6, 7, 8, 1, 9, 10, 11, 12, 13, 14, 15 -- 2.39.2