The following pages link to Gennian Ge (Q182056):
Displaying 50 items.
- Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven (Q5189502) (← links)
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups (Q5206236) (← links)
- On Private Information Retrieval Array Codes (Q5211388) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5 (Q5271941) (← links)
- Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five (Q5273624) (← links)
- New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach (Q5280905) (← links)
- Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six (Q5281489) (← links)
- Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2 (Q5295472) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Combinatorial Constructions for Optimal Splitting Authentication Codes (Q5317578) (← links)
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings (Q5346131) (← links)
- Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric (Q5358573) (← links)
- Group Divisible Designs with Block Size Four and Group Type for (Q5406956) (← links)
- On the existence of resolvable K<sub>4</sub> − e designs (Q5434635) (← links)
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio<i>C</i>= 6 (Q5470777) (← links)
- Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\) (Q5934174) (← links)
- On the existence of Room frames of type \(2^n u^1\) (Q5934175) (← links)
- Resolvable balanced incomplete block designs with block size 5 (Q5935427) (← links)
- Almost resolvable perfect Mendelsohn designs with block size five (Q5957295) (← links)
- Resolvable group-divisible designs with block size four (Q5957700) (← links)
- On linear diameter perfect Lee codes with distance 6 (Q6071958) (← links)
- Covering Grassmannian Codes: Bounds and Constructions (Q6118297) (← links)
- Some results on similar configurations in subsets of \(\mathbb{F}_q^d\) (Q6136696) (← links)
- Embedding bipartite distance graphs under Hamming metric in finite fields (Q6162866) (← links)
- Corrigendum: Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2 (Q6186661) (← links)
- Balanced Set Codes With Small Intersections (Q6196095) (← links)
- Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures (Q6197459) (← links)
- Correcting Two-Deletion With a Constant Number of Reads (Q6197479) (← links)
- Multi-part cross-intersecting families (Q6307159) (← links)
- New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies (Q6312784) (← links)
- New lower bounds for the Tur\'{a}n density of $PG_{m}(q)$ (Q6343892) (← links)
- New results on sparse representations in unions of orthonormal bases (Q6519219) (← links)
- On set systems with strongly restricted intersections (Q6530305) (← links)
- Improved constructions of permutation and multi-permutation codes correcting a burst of stable deletions (Q6574747) (← links)
- Sequence reconstruction under single-burst-insertion/deletion/edit channel (Q6574750) (← links)
- Reconstruction of sequences distorted by two insertions (Q6574791) (← links)
- Robust network function computation (Q6575537) (← links)
- Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes (Q6575539) (← links)
- On lattice tilings of \(\mathbb{Z}^n\) by limited magnitude error balls \(B(n,2,1,1)\) (Q6575540) (← links)
- A rainbow framework for coded caching and its applications (Q6576086) (← links)
- Constant \(L_1\)-weight codes under \(L_\infty\)-metric (Q6576657) (← links)
- Swap-robust and almost supermagic complete graphs for dynamical distributed storage (Q6576714) (← links)
- New constructions of signed difference sets (Q6587207) (← links)
- A polynomial resultant approach to algebraic constructions of extremal graphs (Q6668587) (← links)
- Binary codes for correcting two edits (Q6670163) (← links)
- Reconstruction from noisy substrings (Q6670218) (← links)
- Constrained coding upper bounds via Goulden-Jackson cluster theorem (Q6737631) (← links)
- Algebraic approach to stability results for Erdős-Ko-Rado theorem (Q6751121) (← links)
- The Frankl-Pach upper bound is not tight for any uniformity (Q6758347) (← links)
