Hadamard code: Difference between revisions

Revision as of 02:10, 27 October 2015

Revision as of 08:02, 3 December 2015

Line 186:

For each <math>i \in \{1, \dots, n\}</math>:

# Pick <math>j \in \{0, \dots, 2^n-1\}</math> independentlyuniformly at random

# Pick <math>k \in \{0, \dots, 2^n-1\}</math> such that <math>j+k = e_i</math> where <math>j+k</math> is the bitwise ''xor'' of <math>j</math> and <math>k</math>.

# <math>x_i \gets y_j+y_k</math>