More on des Hamiltonian and ldc coding to create a non commutative ordering of quantum bit swaps

The Hamiltonian in des are there to deliver a computation graph based on an infinite set of quaternion groups, which not only generates a uniform sample but preserves quantum randomness as each bit of plaintext is cited with a key bit, thus ensuring that the cipher text retains the same spectral Randomness as the key itself.

The side effect of the expander code is to deliver an diffusion engine that enables a sparse matrix to redistribute the Bayesian factors of each nibble over the entire vector space, in random directions and distance.

You can see the Hamiltonian graphs as the wiring of rotor cores in the rotor versions of des.


About home_pw

Computer Programmer who often does network administration with focus on security servers. Sometimes plays at slot machine programming.
This entry was posted in coding theory. Bookmark the permalink.