Gennian Ge

Suggest Changes
Charles J. Colbourn76
Alan C. H. Ling75
Tuvi Etzion69
Douglas R. Stinson58
Haim Hanani50
52Alan C. H. Ling
35Yeow Meng Chee
25Xiande Zhang
24Xiaohu Tang
24R. Julian R. Abel

Filter Results:

  • Full text PDF available (62)

Publication Year

1995
2017
  • This year (12)
  • Last 5 years (74)
  • Last 10 years (112)

Publication Type

Co-author

Journals and Conferences

Key Phrases

Learn More
Further combinatorial constructions for optimal frequency-hopping sequences
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 [10] from a combinatorial approach, where a correspondence between frequency-hopping sequences and partition-type cyclic difference packings was established,… (More)
Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
Compressed sensing is a sampling technique which provides a fundamentally new approach to data acquisition. Comparing with traditional methods, compressed sensing makes full use of sparsity so that a sparse signal can be reconstructed from very few measurements. A central problem in compressed sensing is the construction of sensing matrices. While random… (More)
Deterministic Sensing Matrices Arising From Near Orthogonal Systems
Compressed sensing is a novel sampling theory, which provides a fundamentally new approach to data acquisition. It asserts that a sparse or compressible signal can be reconstructed from much fewer measurements than traditional methods. A central problem in compressed sensing is the construction of the sensing matrix. While random sensing matrices have been… (More)
Snake-in-the-Box Codes for Rank Modulation under Kendall's $τ$-Metric
For a Gray code in the scheme of rank modulation for flash memories, the codewords are permutations and two consecutive codewords are obtained using a push-to-the-top operation. We consider snake-in-the-box codes under Kendall’s τ -metric, which is a Gray code capable of detecting one Kendall’s τ -error. We answer two open problems posed by Horovitz and… (More)
Centralized coded caching schemes: A hypergraph theoretical approach
The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless network system. Yan et al. reformulate the problem as designing a corresponding placement delivery array and propose two new schemes from this perspective. These schemes above significantly reduce the… (More)
New Bounds on Separable Codes for Multimedia Fingerprinting
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable… (More)