Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Maximum two-dimensional (u × v, 4, 1, 3)-OOCs
Let Φ(u × v, k, λ a , λ c ) be the largest possible number of codewords among all two-dimensional (u × v, k, λ
Article
Let Φ(u × v, k, λ a , λ c ) be the largest possible number of codewords among all two-dimensional (u × v, k, λ