Chee, Yeow Meng, Ge, Gennian, Ling, Alan C. H.
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive...
A SENSITIVE ALGORITHM FOR DETECTING THE INEQUIVALENCE OF HADAMARD MATRICES (2008)
Abstract. A Hadamard matrix of side n is an n × n matrix with every entry either 1 or −1, which satisfies HH T = nI. Two Hadamard matrices are called equivalent if one can be obtained from the...
Chee, Yeow Meng., Ge, Gennian., Ling, Alan C. H.
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive...
Further combinatorial constructions for optimal frequency-hopping sequences (2006)
Gennian Ge, Hangzhou Zhejiang, P. R. China, Ryoh Fuji-hara, Ying Miao
Frequency-hopping multiple-access (FHMA) spread spectrum communication systems employing multiple frequency shift keying as data modulation technique were investigated by Fuji-Hara, Miao and Mishima...
Mandatory representation designs MRD(4, k; v) with k ≡ 1 mod 3 (2005)
Gennian Ge, Martin Grüttmüller, Sven Hartmann, Rolf Rees
A mandatory representation design MRD(K; v) is a pairwise balanced design on v points with block sizes from the set K in which for each k ∈ K there is at least one block in the design of size k. In...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...