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)

  2. No Access

    Article

    On the covering number c λ(3,W 4 (3) , v)

    A t-hyperwheel (t ≥ 3) of length l (or W l (t) for brevity) is...

    Yan Wu, Yan-xun Chang in Acta Mathematicae Applicatae Sinica, English Series (2012)

  3. No Access

    Article

    Decompositions of the 3-uniform hypergraphs K v (3) into hypergraphs of a certain type

    In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K v ...

    Tao Feng, Yan-xun Chang in Science in China Series A: Mathematics (2007)