“…In Construction 3, the numbers of rows of the matrixs A and B should be enough to ensure that both ϕ i and ψ i are bijective mappings. Hence, the following inequation must hold N(u, m, t + 1) • (2 m − 1) • 2 u + M(k, m, t + 1) • 2 k ≥ 2 n , where the value of N(u, m, t + 1) and M(k, m, t + 1) can be found in [19,20].…”