Cunsheng Ding

According to our database1, Cunsheng Ding authored at least 179 papers between 1988 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
All Binary Linear Codes That Are Invariant Under PSL2(n).
IEEE Trans. Information Theory, 2018

Minimal Binary Linear Codes.
IEEE Trans. Information Theory, 2018

Minimal linear codes over finite fields.
Finite Fields and Their Applications, 2018

Another generalisation of the binary Reed-Muller codes and its applications.
Finite Fields and Their Applications, 2018

Infinite families of 3-designs from a type of five-weight code.
Des. Codes Cryptography, 2018

Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes with corrigendum.
CoRR, 2018

The Subfield Codes of Hyperoval and Conic codes.
CoRR, 2018

The Subfield Codes of Ovoid Codes.
CoRR, 2018

Minimal Linear Codes over Finite Fields.
CoRR, 2018

A family of ovoids in PG(3, 2^m) from cyclic codes.
CoRR, 2018

A sequence construction of cyclic codes over finite fields.
Cryptography and Communications, 2018

2017
Two Families of LCD BCH 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

LCD Cyclic Codes Over Finite Fields.
IEEE Trans. Information Theory, 2017

New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters.
IEEE Trans. Information Theory, 2017

Permutation trinomials over F2m.
Finite Fields and Their Applications, 2017

The dimension and minimum distance of two classes of primitive BCH codes.
Finite Fields and Their Applications, 2017

Dimensions of three types of BCH codes over GF(q).
Discrete Mathematics, 2017

Infinite families of 2-designs and 3-designs from linear codes.
Discrete Mathematics, 2017

All binary linear codes that are invariant under PSL2(n).
CoRR, 2017

A spectral characterisation of t-designs.
CoRR, 2017

An infinite family of Steiner systems S(2, 4, 2m) from cyclic codes.
CoRR, 2017

Preface: Special functions and codes.
Cryptography and Communications, 2017

Parameters of 2-Designs from Some BCH Codes.
Proceedings of the Codes, Cryptology and Information Security, 2017

2016
Three-weight cyclic codes and their weight distributions.
Discrete Mathematics, 2016

A construction of binary linear codes from Boolean functions.
Discrete Mathematics, 2016

Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes.
Des. Codes Cryptography, 2016

Dimensions of three types of BCH codes over GF(q).
CoRR, 2016

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

Parameters of two classes of LCD BCH codes.
CoRR, 2016

A Family of Reversible BCH Codes.
CoRR, 2016

Another Generalization of the Reed-Muller Codes.
CoRR, 2016

LCD Cyclic Codes over Finite Fields.
CoRR, 2016

Infinite families of 2-designs and 3-designs from linear codes.
CoRR, 2016

The Dimension and Minimum Distance of Two Classes of Primitive BCH Codes.
CoRR, 2016

A Sequence Construction of Cyclic Codes over Finite Fields.
CoRR, 2016

Infinite families of t-designs from a type of five-weight codes.
CoRR, 2016

2015
Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.
IEEE Trans. Information Theory, 2015

The Bose and Minimum Distance of a Class of BCH Codes.
IEEE Trans. Information Theory, 2015

A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing.
IEEE Trans. Information Theory, 2015

Parameters of Several Classes of BCH Codes.
IEEE Trans. Information Theory, 2015

Linear Codes From Some 2-Designs.
IEEE Trans. Information Theory, 2015

Permutation Trinomials Over Finite Fields with Even Characteristic.
SIAM J. Discrete Math., 2015

Five Constructions of Permutation Polynomials over $\gf(q^2)$.
CoRR, 2015

A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing.
CoRR, 2015

A Construction of Binary Linear Codes from Boolean Functions.
CoRR, 2015

Linear Codes from Some 2-Designs.
CoRR, 2015

2014
New Families of Codebooks Achieving the Levenstein Bound.
IEEE Trans. Information Theory, 2014

The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials.
IEEE Trans. Information Theory, 2014

Three New Families of Zero-Difference Balanced Functions With Applications.
IEEE Trans. Information Theory, 2014

Dickson Polynomials of the Second Kind that Permute Zm.
SIAM J. Discrete Math., 2014

Binary Linear Codes With Three Weights.
IEEE Communications Letters, 2014

A class of three-weight cyclic codes.
Finite Fields and Their Applications, 2014

Corrigenda to "Permutation polynomials over finite fields from a powerful lemma" [Finite Fields Appl. 17(2011) 560-574], "Further results on permutation polynomials over finite fields" [Finite Fields Appl. 27 (2014) 88-103], "Permutation polynomials of the form L(x) + Sa2k + Sb2k over 𝔽q3k" [Finite Fields Appl. 29 (2014) 106-117].
Finite Fields and Their Applications, 2014

Permutation polynomials of the form L(x) + Sa2k + Sb2k over 𝔽q3k.
Finite Fields and Their Applications, 2014

Further results on permutation polynomials over finite fields.
Finite Fields and Their Applications, 2014

Optimal ternary cyclic codes with minimum distance four and five.
Finite Fields and Their Applications, 2014

Binary cyclic codes from explicit polynomials over GF(2m).
Discrete Mathematics, 2014

Constructions of almost difference sets from finite fields.
Des. Codes Cryptography, 2014

Six Constructions of Difference Families.
CoRR, 2014

Permutation trinomials over finite fields with even characteristic.
CoRR, 2014

2013
The Weight Enumerator of Three Families of Cyclic Codes.
IEEE Trans. Information Theory, 2013

A Family of Five-Weight Cyclic Codes and Their Weight Enumerators.
IEEE Trans. Information Theory, 2013

Weight Distribution of a Class of Cyclic Codes With Arbitrary Number of Zeros.
IEEE Trans. Information Theory, 2013

Optimal Ternary Cyclic Codes From Monomials.
IEEE Trans. Information Theory, 2013

Five Families of Three-Weight Ternary Cyclic Codes and Their Duals.
IEEE Trans. Information Theory, 2013

Seven Classes of Three-Weight Cyclic Codes.
IEEE Trans. Communications, 2013

Cyclic Codes from Some Monomials and Trinomials.
SIAM J. Discrete Math., 2013

A q-polynomial approach to cyclic codes.
Finite Fields and Their Applications, 2013

Cyclic codes from cyclotomic sequences of order four.
Finite Fields and Their Applications, 2013

Hamming weights in irreducible cyclic codes.
Discrete Mathematics, 2013

Optimal Ternary Cyclic Codes from Monomials
CoRR, 2013

A Family of Five-Weight Cyclic Codes and Their Weight Enumerators
CoRR, 2013

A Class of Three-Weight Cyclic Codes
CoRR, 2013

The Weight Enumerator of Three Families of Cyclic Codes
CoRR, 2013

Weight Distribution of a Class of Cyclic Codes with Arbitrary Number of Zeros
CoRR, 2013

Further Results on Permutation Polynomials over Finite Fields.
CoRR, 2013

Optimal Ternary Cyclic Codes with Minimum Distance Four and Five.
CoRR, 2013

On the weight distributions of several classes of cyclic codes from APN monomials.
CoRR, 2013

Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$.
CoRR, 2013

Three New Families of Zero-difference Balanced Functions with Applications.
CoRR, 2013

Five Families of Three-Weight Ternary Cyclic Codes and Their Duals.
CoRR, 2013

Unit time-phase signal sets: Bounds and constructions.
Cryptography and Communications, 2013

2012
Cyclic Codes From the Two-Prime Sequences.
IEEE Trans. Information Theory, 2012

Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes.
IEEE Trans. Information Theory, 2012

Cyclic Codes from Cyclotomic Sequences of Order Four
CoRR, 2012

Cyclic Codes from APN and Planar Functions
CoRR, 2012

Cyclic Codes from Dickson Polynomials
CoRR, 2012

A simple stream cipher with proven properties.
Cryptography and Communications, 2012

2011
The Weight Enumerator of a Class of Cyclic Codes.
IEEE Trans. Information Theory, 2011

The Weight Distributions of the Duals of Cyclic Codes With Two Zeros.
IEEE Trans. Information Theory, 2011

Preface.
Int. J. Found. Comput. Sci., 2011

Permutation polynomials over finite fields from a powerful lemma.
Finite Fields and Their Applications, 2011

Bounds on and Constructions of Unit Time-Phase Signal Sets
CoRR, 2011

Cyclotomic Constructions of Cyclic Codes with Length Being the Product of Two Primes
CoRR, 2011

Hamming Weights in Irreducible Cyclic Codes
CoRR, 2011

2010
New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value.
IEEE Trans. Information Theory, 2010

Optimal sets of frequency hopping sequences from linear cyclic codes.
IEEE Trans. Information Theory, 2010

The cross-correlation of binary sequences with optimal autocorrelation.
IEEE Trans. Information Theory, 2010

2009
Sets of frequency hopping sequences: bounds and optimal constructions.
IEEE Trans. Information Theory, 2009

The Weight Distribution of Some Irreducible Cyclic Codes.
IEEE Trans. Information Theory, 2009

Binary sequences with optimal autocorrelation.
Theor. Comput. Sci., 2009

Optimal and perfect difference systems of sets.
J. Comb. Theory, Ser. A, 2009

A Class of Three-Weight and Four-Weight Codes.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
Sets of Optimal Frequency-Hopping Sequences.
IEEE Trans. Information Theory, 2008

Optimal Constant Composition Codes From Zero-Difference Balanced Functions.
IEEE Trans. Information Theory, 2008

Permutation polynomials of the form (xp-x+delta)s+L(x).
Finite Fields and Their Applications, 2008

Constructions of almost difference families.
Discrete Mathematics, 2008

Preface.
Des. Codes Cryptography, 2008

Codebooks from almost difference sets.
Des. Codes Cryptography, 2008

2007
Cyclotomic Linear Codes of Order 3.
IEEE Trans. Information Theory, 2007

Algebraic Constructions of Optimal Frequency-Hopping Sequences.
IEEE Trans. Information Theory, 2007

A Generic Construction of Cartesian Authentication Codes.
IEEE Trans. Information Theory, 2007

A Generic Construction of Complex Codebooks Meeting the Welch Bound.
IEEE Trans. Information Theory, 2007

Signal Sets From Functions With Optimum Nonlinearity.
IEEE Trans. Communications, 2007

Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3, 32h+1).
J. Comb. Theory, Ser. A, 2007

Four classes of permutation polynomials of F2m.
Finite Fields and Their Applications, 2007

Nonlinearities of S-boxes.
Finite Fields and Their Applications, 2007

2006
Secret sharing schemes from three classes of linear codes.
IEEE Trans. Information Theory, 2006

The weight distribution of a class of linear codes from perfect nonlinear functions.
IEEE Trans. Information Theory, 2006

Complex Codebooks From Combinatorial Designs.
IEEE Trans. Information Theory, 2006

A family of skew Hadamard difference sets.
J. Comb. Theory, Ser. A, 2006

On Some Problems of Mateescu Concerning Subword Occurrences.
Fundam. Inform., 2006

Secret Sharing Schemes with Nice Access Structures.
Fundam. Inform., 2006

A Construction of Optimal Constant Composition Codes.
Des. Codes Cryptography, 2006

Constructions of External Difference Families and Disjoint Difference Families.
Des. Codes Cryptography, 2006

Authentication Schemes from Highly Nonlinear Functions.
Des. Codes Cryptography, 2006

2005
Combinatorial constructions of optimal constant-composition codes.
IEEE Trans. Information Theory, 2005

A family of optimal constant-composition codes.
IEEE Trans. Information Theory, 2005

Algebraic constructions of constant composition codes.
IEEE Trans. Information Theory, 2005

Linear codes from perfect nonlinear mappings and their secret sharing schemes.
IEEE Trans. Information Theory, 2005

A coding theory construction of new systematic authentication codes.
Theor. Comput. Sci., 2005

2004
Systematic authentication codes from highly nonlinear functions.
IEEE Trans. Information Theory, 2004

Cyclotomic Optical Orthogonal Codes of Composite Lengths.
IEEE Trans. Communications, 2004

A short biography of Harald Niederreiter.
J. Complexity, 2004

Special issue on cryptography and coding theory.
J. Complexity, 2004

Highly nonlinear mappings.
J. Complexity, 2004

Several Generalizations Of Shamir's Secret Sharing Scheme.
Int. J. Found. Comput. Sci., 2004

Three Constructions of Authentication Codes with Perfect Secrecy.
Des. Codes Cryptography, 2004

2003
Low-correlation, large linear span sequences from function fields.
IEEE Trans. Information Theory, 2003

Cartesian authentication codes from functions with optimal nonlinearity.
Theor. Comput. Sci., 2003

Logarithm cartesian authentication codes.
Inf. Comput., 2003

Secret Sharing Schemes from Two-Weight Codes.
Electronic Notes in Discrete Mathematics, 2003

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets.
Des. Codes Cryptography, 2003

Several Classes of (2m-1, w, 2) Optical Orthogonal Codes.
Discrete Applied Mathematics, 2003

Covering and Secret Sharing with Linear Codes.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Three Constructions of Authentication/Secrecy Codes.
Proceedings of the Applied Algebra, 2003

2002
The minimum distance of the duals of binary irreducible cyclic codes.
IEEE Trans. Information Theory, 2002

Constructions of permutation arrays.
IEEE Trans. Information Theory, 2002

2001
New families of binary sequences with optimal three-level autocorrelation.
IEEE Trans. Information Theory, 2001

Almost difference sets and their sequences with optimal autocorrelation.
IEEE Trans. Information Theory, 2001

Several Classes of (2m - 1, w, 2) Optical Orthogonal Codes.
Electronic Notes in Discrete Mathematics, 2001

Two classes of ternary codes and their weight distributions.
Discrete Applied Mathematics, 2001

2000
Some new codes from algebraic curves.
IEEE Trans. Information Theory, 2000

Split group codes.
IEEE Trans. Information Theory, 2000

Elementary 2-group character codes.
IEEE Trans. Information Theory, 2000

Secret-sharing with a class of ternary codes.
Theor. Comput. Sci., 2000

Duadic sequences of prime lengths.
Discrete Mathematics, 2000

1999
Cyclotomy and Duadic Codes of Prime Lengths.
IEEE Trans. Information Theory, 1999

Several classes of binary sequences with three-level autocorrelation.
IEEE Trans. Information Theory, 1999

Generalized Cyclotomic Codes of Length p1e1 ... ptet.
IEEE Trans. Information Theory, 1999

Construction and Enumeration of All Binary Duadic Codes of Length pm.
Fundam. Inform., 1999

1998
On the Linear Complexity of Legendre Sequences.
IEEE Trans. Information Theory, 1998

Autocorrelation Values of Generalized Cyclotomic Sequences of Order Two.
IEEE Trans. Information Theory, 1998

Pattern Distributions of Legendre Sequences.
IEEE Trans. Information Theory, 1998

On Cyclotomic Generator of Order r.
Inf. Process. Lett., 1998

Linear Complexity of Some Generalized Cyclotomic Sequences.
IJAC, 1998

How to Build Robust Shared Control Systems.
Des. Codes Cryptography, 1998

1997
Linear Multisecret-Sharing Schemes and Error-Correcting Codes.
J. UCS, 1997

TWOPRIME: A Fast Stream Ciphering Algorithm.
Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

1996
On Cooperatively Distributed Ciphering and Hashing.
Computers and Artificial Intelligence, 1996

The access structure of some secret-sharing schemes.
Proceedings of the Information Security and Privacy, First Australasian Conference, 1996

A nonlinear secret sharing scheme.
Proceedings of the Information Security and Privacy, First Australasian Conference, 1996

1994
Binary Cyclotomic Generators.
Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

1993
The Differential Cryptanalysis and Design of Natural Stream Ciphers.
Proceedings of the Fast Software Encryption, 1993

On Almost Perfect Nonlinear Permutations.
Proceedings of the Advances in Cryptology, 1993

1991
The Stability Theory of Stream Ciphers
Lecture Notes in Computer Science 561, Springer, ISBN: 3-540-54973-0, 1991

1990
Lower Bounds on the Weight Complexities of Cascaded Binary Sequences.
Proceedings of the Advances in Cryptology, 1990

1988
Proof of Massey's Conjectured Algorithm.
Proceedings of the Advances in Cryptology, 1988


  Loading...