Articles with public access mandates - Gennian GeLearn more
Not available anywhere: 17
New bounds on separable codes for multimedia fingerprinting
F Gao, G Ge
IEEE transactions on information theory 60 (9), 5257-5262, 2014
Mandates: National Natural Science Foundation of China
Constructions of optimal Ferrers diagram rank metric codes
T Zhang, G Ge
Designs, Codes and Cryptography 87, 107-121, 2019
Mandates: National Natural Science Foundation of China
Asymptotically optimal optical orthogonal signature pattern codes
L Ji, B Ding, X Wang, G Ge
IEEE Transactions on Information Theory 64 (7), 5419-5431, 2018
Mandates: National Natural Science Foundation of China
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
G Ge, S Hu, E Kolotoğlu, H Wei
Journal of Combinatorial Designs 23 (6), 233-273, 2015
Mandates: National Natural Science Foundation of China
Sequence reconstruction under single-burst-insertion/deletion/edit channel
Y Sun, Y Xi, G Ge
IEEE Transactions on Information Theory 69 (7), 4466-4483, 2023
Mandates: National Natural Science Foundation of China
The existence of well‐balanced triple systems
H Wei, G Ge, CJ Colbourn
Journal of Combinatorial Designs 24 (2), 77-100, 2016
Mandates: National Natural Science Foundation of China
Balanced set codes with small intersections
W Yu, Y Xi, X Wei, G Ge
IEEE Transactions on Information Theory 69 (1), 147-156, 2022
Mandates: National Natural Science Foundation of China
Correcting two-deletion with a constant number of reads
Y Sun, G Ge
IEEE Transactions on Information Theory 69 (5), 2969-2982, 2022
Mandates: National Natural Science Foundation of China
New results on self-dual generalized Reed-Solomon codes
Y Ning, Z Ye, G Ge, F Miao, Y Xiong, X Zhang
IEEE Transactions on Information Theory 67 (11), 7240-7252, 2021
Mandates: National Natural Science Foundation of China
Kirkman frames having hole type for
H Wei, G Ge
Designs, codes and cryptography 72 (3), 497-510, 2014
Mandates: National Natural Science Foundation of China
Room squares with super-simple property
M Zhu, G Ge
Designs, codes and cryptography 71, 365-381, 2014
Mandates: National Natural Science Foundation of China
Robust network function computation
H Wei, M Xu, G Ge
IEEE Transactions on Information Theory, 2023
Mandates: National Natural Science Foundation of China
Optimal Groomings with Grooming Ratios Six and Seven
G Ge, E Kolotoğlu, H Wei
Journal of Combinatorial Designs 23 (9), 400-415, 2015
Mandates: National Natural Science Foundation of China
On lattice tilings of Zn by limited magnitude error balls B(n, 2, 1, 1)
T Zhang, Y Lian, G Ge
IEEE Transactions on Information Theory, 2023
Mandates: National Natural Science Foundation of China
Embedding bipartite distance graphs under Hamming metric in finite fields
Z Xu, W Yu, G Ge
Journal of Combinatorial Theory, Series A 198, 105765, 2023
Mandates: National Natural Science Foundation of China
On the minimal degree condition of graphs implying equality of the largest Kr-free subgraphs and (r− 1)-partite subgraphs
B Qian, C Xie, G Ge
Discrete Mathematics 344 (8), 112453, 2021
Mandates: National Natural Science Foundation of China
Directed PBDs with Block Sizes from K Where K
H Wei, G Ge
Journal of Combinatorial Designs 25 (12), 535-555, 2017
Mandates: National Natural Science Foundation of China
Available somewhere: 77
Centralized coded caching schemes: A hypergraph theoretical approach
C Shangguan, Y Zhang, G Ge
IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018
Mandates: National Natural Science Foundation of China
Some new classes of quantum MDS codes from constacyclic codes
T Zhang, G Ge
IEEE Transactions on Information Theory 61 (9), 5224-5228, 2015
Mandates: National Natural Science Foundation of China
Narrow-Sense BCH Codes Over With Length
S Li, C Ding, M Xiong, G Ge
IEEE Transactions on Information Theory 63 (11), 7219-7236, 2017
Mandates: National Natural Science Foundation of China, Research Grants Council, Hong Kong
Publication and funding information is determined automatically by a computer program