Gennian Ge

According to our database1, Gennian Ge authored at least 142 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

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

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

Maximum distance separable codes for b-symbol read channels.
Finite Fields and Their Applications, 2018

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

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

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

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

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

Perfect and Quasi-Perfect Codes Under the lp Metric.
IEEE Trans. Information Theory, 2017

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

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

Narrow-Sense BCH Codes Over GF(q) With Length n=(qm-1)/(q-1).
IEEE Trans. Information Theory, 2017

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

Invertible binary matrices with maximum number of 2-by-2 invertible submatrices.
Discrete Mathematics, 2017

Some more uniformly resolvable designs with block sizes 2 and 4.
Discrete Mathematics, 2017

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

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

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

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

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

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

Snake-in-the-Box Codes for Rank Modulation under Kendall's τ-Metric in S2n+2.
IEEE Trans. Information Theory, 2016

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

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

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

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

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

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

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

Deterministic convolutional compressed sensing matrices.
Finite Fields and Their Applications, 2016

Uniformly resolvable designs with block sizes 3 and 4.
Discrete Mathematics, 2016

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

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

Optimal ternary constant-composition codes with weight four and distance six.
Discrete Mathematics, 2015

Group divisible designs with block size four and group type gum1.
Des. Codes Cryptography, 2015

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

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

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

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

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

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

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

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

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

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

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

Some more 5-GDDs, 4-frames and 4-RGDDs.
Discrete Mathematics, 2014

Group divisible designs with block sizes from Kl(3) and Kirkman frames of type huml.
Discrete Mathematics, 2014

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

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

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

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

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

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

Group divisible designs with block size four and group type gum1gum1 for more small gg.
Discrete Mathematics, 2013

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

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

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

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

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

Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments.
Discrete Applied Mathematics, 2012

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

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

Optical grooming with grooming ratio nine.
Discrete Mathematics, 2011

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

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

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

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

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

Mixed group divisible designs with three groups and block size 4.
Discrete Mathematics, 2010

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

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

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

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices.
Discrete Applied Mathematics, 2010

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

The Existence of r×4 Grid-Block Designs with r=3, 4.
SIAM J. Discrete Math., 2009

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

Resolvable group divisible designs with block size four and general index.
Discrete Mathematics, 2009

Graph designs for the eight-edge five-vertex graphs.
Discrete Mathematics, 2009

Further results on (v, {5, w*}, 1)-PBDs.
Discrete Mathematics, 2009

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

Optical grooming with grooming ratio eight.
Discrete Applied Mathematics, 2009

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

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

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

Frame self-orthogonal Mendelsohn triple systems of type hn.
Discrete Mathematics, 2008

Resolvable balanced incomplete block designs with subdesigns of block size 4.
Discrete Mathematics, 2008

Mandatory representation designs I with k=2mod3.
Discrete Mathematics, 2008

Construction of optimal ternary constant weight codes via Bhaskar Rao designs.
Discrete Mathematics, 2008

Existence of directed triplewhist tournaments with the three person property 3PDTWh(v).
Discrete Applied Mathematics, 2008

2007
On the Existence of K5 \setminuse-Designs with Application to Optical Networks.
SIAM J. Discrete 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 and Combinatorics, 2007

On the existence of partitionable skew Room frames.
Discrete Mathematics, 2007

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

Kirkman frames having hole type hu m1 for small h.
Des. Codes Cryptography, 2007

2006
Scheduling CCRR 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.
Discrete Mathematics, 2006

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

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

Existence of directedwhist tournaments with the three person property 3PDWh(v).
Discrete Applied Mathematics, 2006

New Z-cyclic triplewhist frames and triplewhist tournament designs.
Discrete Applied Mathematics, 2006

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

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6.
SIAM J. Discrete Math., 2005

Constructions of Quad-Rooted Double Covers.
Graphs and Combinatorics, 2005

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

On (g, 4;1)-difference matrices.
Discrete Mathematics, 2005

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

Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m.
Des. Codes Cryptography, 2005

Some new optimal quaternary constant weight codes.
Science in China Series F: Information Sciences, 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.
Discrete Mathematics, 2004

On group-divisible designs with block size four and group-type 6um1.
Discrete Mathematics, 2004

A survey on resolvable group divisible designs with block size four.
Discrete Mathematics, 2004

Group divisible designs with block size four and group type gum1 for small g.
Discrete Mathematics, 2004

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

Combinatorial constructions for optimal supersaturated designs.
Discrete Mathematics, 2004

Existence of (v, {5, wstar}, 1)-PBDs.
Discrete Mathematics, 2004

Whist tournaments with the three person property.
Discrete Applied Mathematics, 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.
Discrete Mathematics, 2003

Bhaskar Rao designs with block size four.
Discrete Mathematics, 2003

Resolvable group divisible designs with block size four and group size six.
Discrete Mathematics, 2003

A new construction for Z-cyclic whist tournaments.
Discrete Applied Mathematics, 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.
Discrete Mathematics, 2002

Existence of Steiner seven-cycle systems.
Discrete Mathematics, 2002

Resolvable perfect Mendelsohn designs with block size five.
Discrete Mathematics, 2002

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

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

Almost resolvable perfect Mendelsohn designs with block size five.
Discrete Applied Mathematics, 2002

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

2001
Constructions for optimal (v, 4, 1) optical orthogonal codes.
IEEE Trans. Information 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).
Australasian J. Combinatorics, 2000

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

1995
Existence of almost resolvable directed 5-cycle systems.
Australasian J. Combinatorics, 1995


  Loading...