| Algorithm 2 Algorithm to construct . |
| Input:n,s(<n) |
| H = binom(n,s) H = −sum(H(:,1:n−1),2) B = zeros(n) for i = 1:n do |
| ⌊ j = mod(i − 1:s + i − 1, n) + 1 B(i,j) = [1; −H(:,j(2 : s + 1))]\H(:,j(1))] |
| output: with (s + 1) non-zeros in each row. |
| Algorithm 2 Algorithm to construct . |
| Input:n,s(<n) |
| H = binom(n,s) H = −sum(H(:,1:n−1),2) B = zeros(n) for i = 1:n do |
| ⌊ j = mod(i − 1:s + i − 1, n) + 1 B(i,j) = [1; −H(:,j(2 : s + 1))]\H(:,j(1))] |
| output: with (s + 1) non-zeros in each row. |