![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
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...
-
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 ...