Skip to main content

and
  1. No Access

    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, λ

    Yue-mei Huang, Yan-xun Chang in Applied Mathematics-A Journal of Chinese Universities (2013)