Gennian Ge

Affiliations:
  • Capital Normal University, School of Mathematical Sciences, Beijing, China
  • Guangzhou University, School of Mathematics and Information Science, Guangzhou, China
  • Zhejiang University, Department of Mathematics, Hangzhou, China (2004 - 2013)
  • Suzhou University, Department of Mathematics, Suzhou, China (PhD 1996)


According to our database1, Gennian Ge authored at least 202 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On linear diameter perfect Lee codes with distance 6.
J. Comb. Theory, Ser. A, January, 2024

A Rainbow Framework for Coded Caching and Its Applications.
IEEE Trans. Inf. Theory, 2024

New results on sparse representations in unions of orthonormal bases.
CoRR, 2024

2023
Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, November, 2023

On Lattice Tilings of ℤ<sup>n</sup> by Limited Magnitude Error Balls B(n, 2, 1, 1).
IEEE Trans. Inf. Theory, November, 2023

Robust Network Function Computation.
IEEE Trans. Inf. Theory, November, 2023

Some results on similar configurations in subsets of Fqd.
Finite Fields Their Appl., October, 2023

Reconstruction of Sequences Distorted by Two Insertions.
IEEE Trans. Inf. Theory, August, 2023

Embedding bipartite distance graphs under Hamming metric in finite fields.
J. Comb. Theory, Ser. A, August, 2023

Improved Constructions of Permutation and Multi-Permutation Codes Correcting a Burst of Stable Deletions.
IEEE Trans. Inf. Theory, July, 2023

Sequence Reconstruction Under Single-Burst-Insertion/Deletion/Edit Channel.
IEEE Trans. Inf. Theory, July, 2023

Covering Grassmannian Codes: Bounds and Constructions.
IEEE Trans. Inf. Theory, June, 2023

New lower bounds for the Turán density of <i>PG</i><sub><i>m</i></sub>(<i>q</i>).
Discret. Math., June, 2023

Correcting Two-Deletion With a Constant Number of Reads.
IEEE Trans. Inf. Theory, May, 2023

Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures.
IEEE Trans. Inf. Theory, May, 2023

Balanced Set Codes With Small Intersections.
IEEE Trans. Inf. Theory, 2023

Reconstruction from Noisy Substrings.
CoRR, 2023

2022
Some sum-product estimates in matrix rings over finite fields.
Finite Fields Their Appl., 2022

Bollobás-type theorems for hemi-bundled two families.
Eur. J. Comb., 2022

On vertex-induced weighted Turán problems.
Discret. Math., 2022

A note on multicolor Ramsey number of small odd cycles versus a large clique.
Discret. Math., 2022

On color isomorphic subdivisions.
Discret. Math., 2022

On linear diameter perfect Lee codes with diameter 6.
CoRR, 2022

A generic framework for coded caching and distributed computation schemes.
CoRR, 2022

Optimal Quaternary Locally Repairable Codes Attaining the Singleton-like Bound.
CoRR, 2022

Network Function Computation With Different Secure Conditions.
CoRR, 2022

Coding schemes for locally balanced constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage.
IEEE Trans. Inf. Theory, 2021

New Results on Self-Dual Generalized Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2021

New Constructions of Optimal Locally Repairable Codes With Super-Linear Length.
IEEE Trans. Inf. Theory, 2021

New Bounds and Constructions for Constant Weighted X-Codes.
IEEE Trans. Inf. Theory, 2021

On the Codegree Density of PG<sub>m(q)</sub>.
SIAM J. Discret. Math., 2021

Sparse hypergraphs: New bounds and constructions.
J. Comb. Theory, Ser. B, 2021

Some results on <i>k</i>-Turán-good graphs.
Discret. Math., 2021

On the minimal degree condition of graphs implying equality of the largest <i>K</i><sub><i>r</i></sub>-free subgraphs and (<i>r</i> - 1)-partite subgraphs.
Discret. Math., 2021

2020
Some New Results on Splitter Sets.
IEEE Trans. Inf. Theory, 2020

Erdös-Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields.
SIAM J. Discret. Math., 2020

Color Isomorphic Even Cycles and a Related Ramsey Problem.
SIAM J. Discret. Math., 2020

Some tight lower bounds for Turán problems via constructions of multi-hypergraphs.
Eur. J. Comb., 2020

2019
On Private Information Retrieval Array Codes.
IEEE Trans. Inf. Theory, 2019

Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups.
SIAM J. Discret. Math., 2019

A general private information retrieval scheme for MDS coded databases with colluding servers.
Des. Codes Cryptogr., 2019

Constructions of optimal Ferrers diagram rank metric codes.
Des. Codes Cryptogr., 2019

New theoretical bounds and constructions of permutation codes under block permutation metric.
Des. Codes Cryptogr., 2019

A new piggybacking design for systematic MDS storage codes.
Des. Codes Cryptogr., 2019

New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies.
CoRR, 2019

2018
On the Nonexistence of Perfect Splitter Sets.
IEEE Trans. Inf. Theory, 2018

Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach.
IEEE Trans. Inf. Theory, 2018

Asymptotically Optimal Optical Orthogonal Signature Pattern Codes.
IEEE Trans. Inf. Theory, 2018

Maximum distance separable codes for <i>b</i>-symbol read channels.
Finite Fields Their Appl., 2018

A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo p.
Discret. Math., 2018

Combinatorial constructions of packings in Grassmannian spaces.
Des. Codes Cryptogr., 2018

New upper bounds for parent-identifying codes and traceability codes.
Des. Codes Cryptogr., 2018

New constructions of MDS symbol-pair codes.
Des. Codes Cryptogr., 2018

2017
Splitter Sets and k-Radius Sequences.
IEEE Trans. Inf. Theory, 2017

Perfect and Quasi-Perfect Codes Under the l<sub>p</sub> Metric.
IEEE Trans. Inf. Theory, 2017

New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach.
IEEE Trans. Inf. Theory, 2017

New Bounds for Frameproof Codes.
IEEE Trans. Inf. Theory, 2017

Narrow-Sense BCH Codes Over GF(q) With Length n=(q<sup>m</sup>-1)/(q-1).
IEEE Trans. Inf. Theory, 2017

A note on permutation polynomials over finite fields.
Finite Fields Their Appl., 2017

Invertible binary matrices with maximum number of 2-by-2 invertible submatrices.
Discret. Math., 2017

Some more uniformly resolvable designs with block sizes 2 and 4.
Discret. Math., 2017

Quantum MDS codes with large minimum distance.
Des. Codes Cryptogr., 2017

New bounds of permutation codes under Hamming metric and Kendall's τ -metric.
Des. Codes Cryptogr., 2017

Some new results on permutation polynomials over finite fields.
Des. Codes Cryptogr., 2017

Generic constructions for partitioned difference families with applications: a unified combinatorial approach.
Des. Codes Cryptogr., 2017

Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes.
Des. Codes Cryptogr., 2017

Multi-file Private Information Retrieval from MDS Coded Databases with Colluding Servers.
CoRR, 2017

Some intriguing upper bounds for separating hash families.
CoRR, 2017

2016
Quantum Codes Derived From Certain Classes of Polynomials.
IEEE Trans. Inf. Theory, 2016

Snake-in-the-Box Codes for Rank Modulation under Kendall's τ-Metric in S<sub>2n+2</sub>.
IEEE Trans. Inf. Theory, 2016

New Results on Codes Correcting Single Error of Limited Magnitude for Flash Memory.
IEEE Trans. Inf. Theory, 2016

Snake-in-the-Box Codes for Rank Modulation Under Kendall's τ-Metric.
IEEE Trans. Inf. Theory, 2016

The Weight Hierarchy of Some Reducible Cyclic Codes.
IEEE Trans. Inf. Theory, 2016

New Bounds and Constructions for Multiply Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2016

New Bounds on the Number of Tests for Disjunct Matrices.
IEEE Trans. Inf. Theory, 2016

Pseudo-cyclic Codes and the Construction of Quantum MDS Codes.
IEEE Trans. Inf. Theory, 2016

Separating Hash Families: A Johnson-type bound and New Constructions.
SIAM J. Discret. Math., 2016

Deterministic convolutional compressed sensing matrices.
Finite Fields Their Appl., 2016

Uniformly resolvable designs with block sizes 3 and 4.
Discret. Math., 2016

Invertible binary matrix with maximum number of $2$-by-$2$ invertible submatrices.
CoRR, 2016

New results for traitor tracing schemes.
CoRR, 2016

Narrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$.
CoRR, 2016

Maximum Distance Separable Codes for b-Symbol Read Channels.
CoRR, 2016

2015
Some New Classes of Quantum MDS Codes From Constacyclic Codes.
IEEE Trans. Inf. Theory, 2015

Fourth Power Residue Double Circulant Self-Dual Codes.
IEEE Trans. Inf. Theory, 2015

Optimal ternary constant-composition codes with weight four and distance six.
Discret. Math., 2015

Group divisible designs with block size four and group type g<sup>u</sup>m<sup>1</sup>.
Des. Codes Cryptogr., 2015

Spectrum of sizes for perfect 2-deletion-correcting codes of length 4.
Des. Codes Cryptogr., 2015

Completely reducible super-simple designs with block size five and index two.
Des. Codes Cryptogr., 2015

New pseudo-planar binomials in characteristic two and related schemes.
Des. Codes Cryptogr., 2015

Hanani triple packings and optimal q-ary codes of constant weight three.
Des. Codes Cryptogr., 2015

Some Improvements on Locally Repairable Codes.
CoRR, 2015

Quantum Codes from Generalized Reed-Solomon Codes and Matrix-Product Codes.
CoRR, 2015

Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials.
CoRR, 2015

New results on permutation polynomials over finite fields.
CoRR, 2015

On a Conjecture of Erd{ő}s, Frankl and F{ü}redi.
CoRR, 2015

New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes.
CoRR, 2015

On the Existence of Certain Optimal Self-Dual Codes with Lengths Between 74 and 116.
Electron. J. Comb., 2015

2014
Deterministic Construction of Sparse Sensing Matrices via Finite Geometry.
IEEE Trans. Signal Process., 2014

Some New Results on the Cross Correlation of m-Sequences.
IEEE Trans. Inf. Theory, 2014

Deterministic Sensing Matrices Arising From Near Orthogonal Systems.
IEEE Trans. Inf. Theory, 2014

On the Weight Distribution of Cyclic Codes With Niho Exponents.
IEEE Trans. Inf. Theory, 2014

New Bounds on Separable Codes for Multimedia Fingerprinting.
IEEE Trans. Inf. Theory, 2014

A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings.
IEEE Trans. Inf. Theory, 2014

Some more 5-GDDs, 4-frames and 4-RGDDs.
Discret. Math., 2014

Group divisible designs with block sizes from K<sub>l(3)</sub> and Kirkman frames of type h<sup>u</sup>m<sup>l</sup>.
Discret. Math., 2014

Room squares with super-simple property.
Des. Codes Cryptogr., 2014

Kirkman frames having hole type $$h^{u} m^{1}$$ for $$h \equiv 0 {\, \, \mathrm{mod}\, 12}\, $$.
Des. Codes Cryptogr., 2014

Difference sets with few character values.
Des. Codes Cryptogr., 2014

2013
Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five.
IEEE Trans. Inf. Theory, 2013

The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs.
IEEE Trans. Inf. Theory, 2013

An Improvement on the Gilbert-Varshamov Bound for Permutation Codes.
IEEE Trans. Inf. Theory, 2013

Group divisible designs with block size four and group type <i>g</i><sup><i>u</i></sup><i>m</i><sup>1</sup>gum1 for more small <i>g</i>g.
Discret. Math., 2013

A new existence proof for Steiner quadruple systems.
Des. Codes Cryptogr., 2013

2012
Quaternary Constant-Composition Codes With Weight 4 and Distances 5 or 6.
IEEE Trans. Inf. Theory, 2012

Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5.
IEEE Trans. Inf. Theory, 2012

Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves.
IEEE Trans. Inf. Theory, 2012

Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four.
Des. Codes Cryptogr., 2012

Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments.
Discret. Appl. Math., 2012

Association schemes related to Delsarte-Goethals codes
CoRR, 2012

Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six
CoRR, 2012

2011
Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five.
IEEE Trans. Inf. Theory, 2011

A Complete Generalization of Clatworthy Group Divisible Designs.
SIAM J. Discret. Math., 2011

Optical grooming with grooming ratio nine.
Discret. Math., 2011

Completely reducible super-simple designs with block size four and related super-simple packings.
Des. Codes Cryptogr., 2011

List decodability at small radii.
Des. Codes Cryptogr., 2011

2010
Optimal ternary constant-weight codes of weight four and distance six.
IEEE Trans. Inf. Theory, 2010

Monotonic Directed Designs.
SIAM J. Discret. Math., 2010

Spectrum of Sizes for Perfect Deletion-Correcting Codes.
SIAM J. Discret. Math., 2010

Mixed group divisible designs with three groups and block size 4.
Discret. Math., 2010

H-designs with the properties of resolvability or (1, 2)-resolvability.
Des. Codes Cryptogr., 2010

Existence of resolvable H-designs with group sizes 2, 3, 4 and 6.
Des. Codes Cryptogr., 2010

On uniformly resolvable designs with block sizes 3 and 4.
Des. Codes Cryptogr., 2010

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices.
Discret. Appl. Math., 2010

Supporting Information for the Paper: Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five, IEEE Trans. Inform. Theory, To Appear
CoRR, 2010

2009
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties.
IEEE Trans. Inf. Theory, 2009

The Existence of r<sup>×</sup>4 Grid-Block Designs with r=3, 4.
SIAM J. Discret. Math., 2009

On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions.
SIAM J. Discret. Math., 2009

Resolvable group divisible designs with block size four and general index.
Discret. Math., 2009

Graph designs for the eight-edge five-vertex graphs.
Discret. Math., 2009

Further results on (v, {5, w<sup>*</sup>}, 1)-PBDs.
Discret. Math., 2009

The existence of generalized mix functions.
Des. Codes Cryptogr., 2009

Optical grooming with grooming ratio eight.
Discret. Appl. Math., 2009

2008
A Systematic Construction for Radar Arrays.
IEEE Trans. Inf. Theory, 2008

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three.
IEEE Trans. Inf. Theory, 2008

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.
SIAM J. Discret. Math., 2008

Frame self-orthogonal Mendelsohn triple systems of type h<sup>n</sup>.
Discret. Math., 2008

Resolvable balanced incomplete block designs with subdesigns of block size 4.
Discret. Math., 2008

Mandatory representation designs <i>I</i> with k=2mod3.
Discret. Math., 2008

Construction of optimal ternary constant weight codes via Bhaskar Rao designs.
Discret. Math., 2008

Existence of directed triplewhist tournaments with the three person property 3PDTWh(v).
Discret. Appl. Math., 2008

2007
On the Existence of K<sub>5 \setminuse</sub>-Designs with Application to Optical Networks.
SIAM J. Discret. Math., 2007

Triplewhist tournaments with the three person property.
J. Comb. Theory, Ser. A, 2007

General frame constructions for Z-cyclic triplewhist tournaments.
J. Comb. Theory, Ser. A, 2007

Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups.
Graphs Comb., 2007

On the existence of partitionable skew Room frames.
Discret. Math., 2007

Existence of Z-cyclic 3PDTWh(p) for Prime p == 1 (mod 4).
Des. Codes Cryptogr., 2007

Kirkman frames having hole type h<sup>u</sup> m<sup>1</sup> for small h.
Des. Codes Cryptogr., 2007

2006
Scheduling <i>CCRR</i> tournaments.
J. Comb. Theory, Ser. A, 2006

Further combinatorial constructions for optimal frequency-hopping sequences.
J. Comb. Theory, Ser. A, 2006

Resolvable group divisible designs with block size four and index three.
Discret. Math., 2006

GOB designs for authentication codes with arbitration.
Des. Codes Cryptogr., 2006

Combinatorial characterizations of one-coincidence frequency-hopping sequences.
Des. Codes Cryptogr., 2006

Existence of directedwhist tournaments with the three person property 3PDWh(v).
Discret. Appl. Math., 2006

New Z-cyclic triplewhist frames and triplewhist tournament designs.
Discret. Appl. Math., 2006

2005
Combinatorial Constructions for Optimal Splitting Authentication Codes.
SIAM J. Discret. Math., 2005

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio <i>C</i> = 6.
SIAM J. Discret. Math., 2005

Constructions of Quad-Rooted Double Covers.
Graphs Comb., 2005

Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(upsilon).
Eur. J. Comb., 2005

On (<i>g</i>, 4;1)-difference matrices.
Discret. Math., 2005

Resolvable Maximum Packings with Quadruples.
Des. Codes Cryptogr., 2005

Group Divisible Designs with Block Size Four and Group Type <i>g</i><sup><i>u</i></sup><i>m</i><sup>1</sup> with Minimum <i>m</i>.
Des. Codes Cryptogr., 2005

Some new optimal quaternary constant weight codes.
Sci. China Ser. F Inf. Sci., 2005

2004
A sensitive algorithm for detecting the inequivalence of Hadamard matrices.
Math. Comput., 2004

A systematic approach to some block design constructions.
J. Comb. Theory, Ser. A, 2004

HGDDs with block size four.
Discret. Math., 2004

On group-divisible designs with block size four and group-type 6<i><sup>u</sup><sub>m</sub></i>1.
Discret. Math., 2004

A survey on resolvable group divisible designs with block size four.
Discret. Math., 2004

Group divisible designs with block size four and group type <i>g<sup>u</sup>m</i><sup>1</sup> for small <i>g</i>.
Discret. Math., 2004

Mandatory representation designs MRD({4, k};v) with k=1 mod 3.
Discret. Math., 2004

Combinatorial constructions for optimal supersaturated designs.
Discret. Math., 2004

Existence of (<i>v</i>, {5, <i>w</i><sup>star</sup>}, 1)-PBDs.
Discret. Math., 2004

Whist tournaments with the three person property.
Discret. Appl. Math., 2004

2003
Some new triplewhist tournaments TWh(v).
J. Comb. Theory, Ser. A, 2003

MGDD with block size 4 and its application to sampling designs.
Discret. Math., 2003

Bhaskar Rao designs with block size four.
Discret. Math., 2003

Resolvable group divisible designs with block size four and group size six.
Discret. Math., 2003

A new construction for Z-cyclic whist tournaments.
Discret. Appl. Math., 2003

2002
Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible.
J. Comb. Theory, Ser. A, 2002

Resolvable group divisible designs with block size four.
Discret. Math., 2002

Existence of Steiner seven-cycle systems.
Discret. Math., 2002

Resolvable perfect Mendelsohn designs with block size five.
Discret. Math., 2002

n Group-Divisible Designs with Block Size Four and Group-Type gum1.
Des. Codes Cryptogr., 2002

The Existence of Four HMOLS with Equal Sized Holes.
Des. Codes Cryptogr., 2002

Almost resolvable perfect Mendelsohn designs with block size five.
Discret. Appl. Math., 2002

Further results on the existence of generalized Steiner triple systems with group size g≡1, 5(mod 6).
Australas. J Comb., 2002

2001
Constructions for optimal (v, 4, 1) optical orthogonal codes.
IEEE Trans. Inf. Theory, 2001

2000
Generalized Steiner Triple Systems with Group Size g = 7, 8.
Ars Comb., 2000

Generalized Steiner triple systems with group size g≡1, 5 (mod 6).
Australas. J Comb., 2000

1999
Some new large sets of KTS(v).
Ars Comb., 1999

1995
Existence of almost resolvable directed 5-cycle systems.
Australas. J Comb., 1995


  Loading...