3. Both Algorithms are Identical

The probability is very small that taking a vector randomly from the permutation set S makes it with a known vector is zero correlation. For example, when n=7, the probability of one success is about 0.0365; when n=8, the probability is about 0.0232; the larger the n, the smaller the probability. Not to mention zero correlation (or orthogonality) to multiple vectors at the same time. If there is no exchange algorithm, OLHD can not be constructed. So, the exchange algorithm is the core of the technical core of the construction of the orthogonal hypercube. If there are no ghosts in her mind, as a doctoral dissertation, how can she just use the three letters "get" to omit the most basic introduction and discussion for the exchange algorithm principle and operation method Including the most basic derivation step (5.1) that reflects the exchange behavior formula (6.1).

J_jl(d_i,d_k)= J(d_i,d_k)- d_jid_jk-d_lid_k+d_jid_lk+d_lid_jk (6.1)

=J(d_i,d_k)-(d_ji-d_li)(d_jk-d_lk) (6.2)

Lin also said that her Exchange algorithm was mimicking Xu(2002). Xu (2002) used a double criterion, J₂ & A₂, which is very different and is not suitable for construction of the hypercubes. Xu(2006)'s derivation process is very long, and the key formula is placed here, Please compare with the previous formula.