[MPlayer-dev-eng] i need help - transformation matrix

[Arpi]

Hi,

> How about doing the same 000, 111, ... 0 1 2 3, with nibbles now to quicker 
> guess the code ... ?!

yes we did it already:

 63 22 44 90  4 81  6 31 86 58 36 11 68 39 73 53
 69 57 18 88 34 71  1 23 46 94 54 27 75 50 30  7
 70 92 20 74 10 37 85 13 56 41 87 65  2 59 24 47
 79 93 29 89 52 15 26 95 40 17  9 45 60 76 62  0
 64 43 66 83 12 16 32 21 72 14 35 28 61 80 78 48
 77  5 82 67 84 38  8 42 19 51  3 91 33 49 25 55

> PS: Are we talking abuot a mathematical matrix or just seeing the 11 CRC-sums 
> as one table, which is called matrix, and on which certain operations are 
> done to transform it ...

just table, or sequence of numbers
and even its width/height is not sure just a guess

we have 96 numbers reordered and we should find the reordering algo
(or teh algo generating the above number table)

anyway it's a bidirectional transformation, ie. the coding and decoding
matrix is the same, so map[map[x]]==x
look at teh above table, the x'th number is just the position of x in the
table. for example, the 0th byte is 63, and teh 63th byte is 0.

> PPS: Docs to this term available ?!
no :(
why the hell would we do RE if there are docs??


A'rpi / Astral & ESP-team

--
Developer of MPlayer, the Movie Player for Linux - http://www.MPlayerHQ.hu