Patent ID: 7864079

Claim:
A method of descrambling a sequence of p scrambled n-state symbols with n>2 and p>1 into a sequence of p descrambled n-state symbols, an n-state symbol being able to assume one of n states, comprising: inputting a first scrambled n-state symbol of the sequence of p scrambled n-state symbols on a first input of a descrambling n-state function; inputting a second n-state symbol on a second input of the descrambling n-state function; generating by a processor of a descrambled n-state symbol in accordance with the descrambling n-state function, wherein a truth table representing the descrambling n-state function is implemented in a memory that is accessed by the processor; wherein a relationship between the first scrambled n-state symbol which may be called A, the second n-state symbol which may be called B and the descrambled n-state symbol which may be called C is defined by the n-state truth table that is commutative and self reversing and that satisfies the following equations for all possible states of A and B: A sc B=C;â€ƒâ€ƒ(1) C sc B=A; andâ€ƒâ€ƒ(2) A sc C=B; andâ€ƒâ€ƒ(3) repeating the previous steps until all symbols of the sequence of p scrambled n-state symbols have been descrambled by the processor.