2024
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances.
IEEE Trans. Inf. Theory, July, 2024
The Extended Codes of a Family of Reversible MDS Cyclic codes.
IEEE Trans. Inf. Theory, July, 2024
Another Infinite Family of Binary Cyclic Codes With Best Parameters Known.
IEEE Trans. Inf. Theory, June, 2024
Several Families of Ternary Negacyclic Codes and Their Duals.
IEEE Trans. Inf. Theory, May, 2024
An Infinite Family of Binary Cyclic Codes With Best Parameters.
IEEE Trans. Inf. Theory, April, 2024
Two Classes of Constacyclic Codes With Variable Parameters [(q<sup>m</sup> - 1)/r, k, d].
IEEE Trans. Inf. Theory, January, 2024
MDS constacyclic codes of length q + 1 over GF(q).
Cryptogr. Commun., January, 2024
New support 5-designs from lifted linear codes.
Theor. Comput. Sci., 2024
The extended codes of some linear codes.
Finite Fields Their Appl., 2024
The extended codes of projective two-weight codes.
Discret. Math., 2024
Lifted Hamming, Simplex and Reed-Muller Codes and Their Designs.
CoRR, 2024
Two classes of constacyclic codes with a square-root-like lower bound.
CoRR, 2024
Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known.
CoRR, 2024
Cyclic and Negacyclic Sum-Rank Codes.
CoRR, 2024
More MDS codes of non-Reed-Solomon type.
CoRR, 2024
2023
Four infinite families of ternary cyclic codes with a square-root-like lower bound.
Finite Fields Their Appl., December, 2023
Five infinite families of binary cyclic codes and their related codes with good parameters.
Finite Fields Their Appl., October, 2023
Several families of irreducible constacyclic and cyclic codes.
Des. Codes Cryptogr., September, 2023
The Hermitian Dual Codes of Several Classes of BCH Codes.
IEEE Trans. Inf. Theory, July, 2023
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs.
IEEE Trans. Inf. Theory, April, 2023
The minimum locality of linear codes.
Des. Codes Cryptogr., 2023
Two families of negacyclic BCH codes.
Des. Codes Cryptogr., 2023
Extended codes and deep holes of MDS codes.
CoRR, 2023
2022
Shortened Linear Codes From APN and PN Functions.
IEEE Trans. Inf. Theory, 2022
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes.
IEEE Trans. Inf. Theory, 2022
Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances.
IEEE Trans. Inf. Theory, 2022
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences.
IEEE Trans. Inf. Theory, 2022
The Subfield Codes of Some [q + 1, 2, q] MDS Codes.
IEEE Trans. Inf. Theory, 2022
The Dual Codes of Several Classes of BCH Codes.
IEEE Trans. Inf. Theory, 2022
Editorial: Special issue on Boolean functions and their applications 2021.
Cryptogr. Commun., 2022
Two Classes of Constacyclic Codes with Variable Parameters.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022
2021
Some Punctured Codes of Several Families of Binary Linear Codes.
IEEE Trans. Inf. Theory, 2021
An Infinite Family of Linear Codes Supporting 4-Designs.
IEEE Trans. Inf. Theory, 2021
Shortened Linear Codes Over Finite Fields.
IEEE Trans. Inf. Theory, 2021
A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes.
IEEE Trans. Inf. Theory, 2021
Cyclic Bent Functions and Their Applications in Sequences.
IEEE Trans. Inf. Theory, 2021
The projective general linear group ${\mathrm {PGL}}(2, 2^m)$ and linear codes of length 2<sup>m+1</sup>.
Des. Codes Cryptogr., 2021
The minimum linear locality of linear codes.
CoRR, 2021
The linear codes of t-designs held in the Reed-Muller and Simplex codes.
Cryptogr. Commun., 2021
Infinite families of 3-designs from o-polynomials.
Adv. Math. Commun., 2021
2020
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs.
IEEE Trans. Inf. Theory, 2020
Two Families of Optimal Linear Codes and Their Subfield Codes.
IEEE Trans. Inf. Theory, 2020
Optimal Binary Linear Codes From Maximal Arcs.
IEEE Trans. Inf. Theory, 2020
Infinite Families of Near MDS Codes Holding t-Designs.
IEEE Trans. Inf. Theory, 2020
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes.
Des. Codes Cryptogr., 2020
The Projective General Linear Group PGL<sub>2</sub>(GF(2s<sup>m</sup>)) and Linear Codes of Length 2<sup>m</sup>+1.
CoRR, 2020
The construction and weight distributions of all projective binary linear codes.
CoRR, 2020
The Subfield Codes of [q+1, 2, q] MDS Codes.
CoRR, 2020
Combinatorial t-designs from special functions.
Cryptogr. Commun., 2020
2019
Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction.
IEEE Trans. Inf. Theory, 2019
Bent Vectorial Functions, Codes and Designs.
IEEE Trans. Inf. Theory, 2019
The Subfield Codes of Ovoid Codes.
IEEE Trans. Inf. Theory, 2019
The subfield codes of hyperoval and conic codes.
Finite Fields Their Appl., 2019
Maximal arcs and extended cyclic codes.
Des. Codes Cryptogr., 2019
Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$.
Des. Codes Cryptogr., 2019
A construction of q-ary linear codes with irreducible cyclic codes.
Des. Codes Cryptogr., 2019
Codes, differentially δ-uniform functions and t-designs.
CoRR, 2019
Steiner systems S(2, 4, 3<sup>m</sup>-1/2) and 2-designs from ternary linear codes of length 3<sup>m</sup>-1/2.
CoRR, 2019
On the nonlinearity of Boolean functions with restricted input.
Cryptogr. Commun., 2019
A spectral characterisation of t-designs and its applications.
Adv. Math. Commun., 2019
2018
All Binary Linear Codes That Are Invariant Under PSL<sub>2</sub>(n).
IEEE Trans. Inf. Theory, 2018
Minimal Binary Linear Codes.
IEEE Trans. Inf. Theory, 2018
Minimal linear codes over finite fields.
Finite Fields Their Appl., 2018
Another generalisation of the binary Reed-Muller codes and its applications.
Finite Fields Their Appl., 2018
Infinite families of 3-designs from a type of five-weight code.
Des. Codes Cryptogr., 2018
Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences.
CoRR, 2018
Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes with corrigendum.
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.
Cryptogr. Commun., 2018
2017
Two Families of LCD BCH 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
LCD Cyclic Codes Over Finite Fields.
IEEE Trans. Inf. Theory, 2017
New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters.
IEEE Trans. Inf. Theory, 2017
Permutation trinomials over F<sub>2<sup>m</sup></sub>.
Finite Fields Their Appl., 2017
The dimension and minimum distance of two classes of primitive BCH codes.
Finite Fields Their Appl., 2017
Dimensions of three types of BCH codes over GF(q).
Discret. Math., 2017
Infinite families of 2-designs and 3-designs from linear codes.
Discret. Math., 2017
A spectral characterisation of t-designs.
CoRR, 2017
An infinite family of Steiner systems S(2, 4, 2<sup>m</sup>) from cyclic codes.
CoRR, 2017
Preface: Special functions and codes.
Cryptogr. Commun., 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.
Discret. Math., 2016
A construction of binary linear codes from Boolean functions.
Discret. Math., 2016
Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes.
Des. Codes Cryptogr., 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
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. Inf. Theory, 2015
The Bose and Minimum Distance of a Class of BCH Codes.
IEEE Trans. Inf. Theory, 2015
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing.
IEEE Trans. Inf. Theory, 2015
Parameters of Several Classes of BCH Codes.
IEEE Trans. Inf. Theory, 2015
Linear Codes From Some 2-Designs.
IEEE Trans. Inf. Theory, 2015
Permutation Trinomials Over Finite Fields with Even Characteristic.
SIAM J. Discret. Math., 2015
Five Constructions of Permutation Polynomials over $\gf(q^2)$.
CoRR, 2015
2014
New Families of Codebooks Achieving the Levenstein Bound.
IEEE Trans. Inf. Theory, 2014
The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials.
IEEE Trans. Inf. Theory, 2014
Three New Families of Zero-Difference Balanced Functions With Applications.
IEEE Trans. Inf. Theory, 2014
Dickson Polynomials of the Second Kind that Permute Z<sub>m</sub>.
SIAM J. Discret. Math., 2014
Binary Linear Codes With Three Weights.
IEEE Commun. Lett., 2014
A class of three-weight cyclic codes.
Finite Fields Their Appl., 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) + S<sup>a</sup><sub>2k</sub> + S<sup>b</sup><sub>2k</sub> over 𝔽<sub>q<sup>3k</sup></sub>" [Finite Fields Appl. 29 (2014) 106-117].
Finite Fields Their Appl., 2014
Permutation polynomials of the form L(x) + S<sup>a</sup><sub>2k</sub> + S<sup>b</sup><sub>2k</sub> over 𝔽<sub>q<sup>3k</sup></sub>.
Finite Fields Their Appl., 2014
Further results on permutation polynomials over finite fields.
Finite Fields Their Appl., 2014
Optimal ternary cyclic codes with minimum distance four and five.
Finite Fields Their Appl., 2014
Binary cyclic codes from explicit polynomials over GF(2<sup>m</sup>).
Discret. Math., 2014
Constructions of almost difference sets from finite fields.
Des. Codes Cryptogr., 2014
Six Constructions of Difference Families.
CoRR, 2014
2013
The Weight Enumerator of Three Families of Cyclic Codes.
IEEE Trans. Inf. Theory, 2013
A Family of Five-Weight Cyclic Codes and Their Weight Enumerators.
IEEE Trans. Inf. Theory, 2013
Weight Distribution of a Class of Cyclic Codes With Arbitrary Number of Zeros.
IEEE Trans. Inf. Theory, 2013
Optimal Ternary Cyclic Codes From Monomials.
IEEE Trans. Inf. Theory, 2013
Five Families of Three-Weight Ternary Cyclic Codes and Their Duals.
IEEE Trans. Inf. Theory, 2013
Seven Classes of Three-Weight Cyclic Codes.
IEEE Trans. Commun., 2013
Cyclic Codes from Some Monomials and Trinomials.
SIAM J. Discret. Math., 2013
A q-polynomial approach to cyclic codes.
Finite Fields Their Appl., 2013
Cyclic codes from cyclotomic sequences of order four.
Finite Fields Their Appl., 2013
Hamming weights in irreducible cyclic codes.
Discret. Math., 2013
Weight Distribution of a Class of Cyclic Codes with Arbitrary Number of Zeros
CoRR, 2013
Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$.
CoRR, 2013
Unit time-phase signal sets: Bounds and constructions.
Cryptogr. Commun., 2013
2012
Cyclic Codes From the Two-Prime Sequences.
IEEE Trans. Inf. Theory, 2012
Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes.
IEEE Trans. Inf. Theory, 2012
Cyclic Codes from APN and Planar Functions
CoRR, 2012
Cyclic Codes from Dickson Polynomials
CoRR, 2012
A simple stream cipher with proven properties.
Cryptogr. Commun., 2012
2011
The Weight Enumerator of a Class of Cyclic Codes.
IEEE Trans. Inf. Theory, 2011
The Weight Distributions of the Duals of Cyclic Codes With Two Zeros.
IEEE Trans. Inf. Theory, 2011
Int. J. Found. Comput. Sci., 2011
Permutation polynomials over finite fields from a powerful lemma.
Finite Fields Their Appl., 2011
Bounds on and Constructions of Unit Time-Phase Signal Sets
CoRR, 2011
2010
New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value.
IEEE Trans. Inf. Theory, 2010
Optimal sets of frequency hopping sequences from linear cyclic codes.
IEEE Trans. Inf. Theory, 2010
The cross-correlation of binary sequences with optimal autocorrelation.
IEEE Trans. Inf. Theory, 2010
2009
Sets of frequency hopping sequences: bounds and optimal constructions.
IEEE Trans. Inf. Theory, 2009
The Weight Distribution of Some Irreducible Cyclic Codes.
IEEE Trans. Inf. Theory, 2009
Binary sequences with optimal autocorrelation.
Theor. Comput. Sci., 2009
Optimal and perfect difference systems of sets.
J. Comb. Theory 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. Inf. Theory, 2008
Optimal Constant Composition Codes From Zero-Difference Balanced Functions.
IEEE Trans. Inf. Theory, 2008
Permutation polynomials of the form (x<sup>p</sup>-x+delta)<sup>s</sup>+L(x).
Finite Fields Their Appl., 2008
Constructions of almost difference families.
Discret. Math., 2008
Des. Codes Cryptogr., 2008
Codebooks from almost difference sets.
Des. Codes Cryptogr., 2008
2007
Cyclotomic Linear Codes of Order 3.
IEEE Trans. Inf. Theory, 2007
Algebraic Constructions of Optimal Frequency-Hopping Sequences.
IEEE Trans. Inf. Theory, 2007
A Generic Construction of Cartesian Authentication Codes.
IEEE Trans. Inf. Theory, 2007
A Generic Construction of Complex Codebooks Meeting the Welch Bound.
IEEE Trans. Inf. Theory, 2007
Signal Sets From Functions With Optimum Nonlinearity.
IEEE Trans. Commun., 2007
Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3, 3<sup>2h+1</sup>).
J. Comb. Theory A, 2007
Four classes of permutation polynomials of F<sub>2<sup>m</sup></sub>.
Finite Fields Their Appl., 2007
Nonlinearities of S-boxes.
Finite Fields Their Appl., 2007
2006
Secret sharing schemes from three classes of linear codes.
IEEE Trans. Inf. Theory, 2006
The weight distribution of a class of linear codes from perfect nonlinear functions.
IEEE Trans. Inf. Theory, 2006
Complex Codebooks From Combinatorial Designs.
IEEE Trans. Inf. Theory, 2006
A family of skew Hadamard difference sets.
J. Comb. Theory A, 2006
On Some Problems of Mateescu Concerning Subword Occurrences.
Fundam. Informaticae, 2006
Secret Sharing Schemes with Nice Access Structures.
Fundam. Informaticae, 2006
A Construction of Optimal Constant Composition Codes.
Des. Codes Cryptogr., 2006
Constructions of External Difference Families and Disjoint Difference Families.
Des. Codes Cryptogr., 2006
Authentication Schemes from Highly Nonlinear Functions.
Des. Codes Cryptogr., 2006
2005
Combinatorial constructions of optimal constant-composition codes.
IEEE Trans. Inf. Theory, 2005
A family of optimal constant-composition codes.
IEEE Trans. Inf. Theory, 2005
Algebraic constructions of constant composition codes.
IEEE Trans. Inf. Theory, 2005
Linear codes from perfect nonlinear mappings and their secret sharing schemes.
IEEE Trans. Inf. 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. Inf. Theory, 2004
Cyclotomic Optical Orthogonal Codes of Composite Lengths.
IEEE Trans. Commun., 2004
A short biography of Harald Niederreiter.
J. Complex., 2004
Special issue on cryptography and coding theory.
J. Complex., 2004
Highly nonlinear mappings.
J. Complex., 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 Cryptogr., 2004
2003
Low-correlation, large linear span sequences from function fields.
IEEE Trans. Inf. 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.
Electron. Notes Discret. Math., 2003
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets.
Des. Codes Cryptogr., 2003
Several Classes of (2<sup>m</sup>-1, w, 2) Optical Orthogonal Codes.
Discret. Appl. Math., 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. Inf. Theory, 2002
Constructions of permutation arrays.
IEEE Trans. Inf. Theory, 2002
2001
New families of binary sequences with optimal three-level autocorrelation.
IEEE Trans. Inf. Theory, 2001
Almost difference sets and their sequences with optimal autocorrelation.
IEEE Trans. Inf. Theory, 2001
Two classes of ternary codes and their weight distributions.
Discret. Appl. Math., 2001
2000
Some new codes from algebraic curves.
IEEE Trans. Inf. Theory, 2000
IEEE Trans. Inf. Theory, 2000
Elementary 2-group character codes.
IEEE Trans. Inf. Theory, 2000
Secret-sharing with a class of ternary codes.
Theor. Comput. Sci., 2000
Duadic sequences of prime lengths.
Discret. Math., 2000
1999
Cyclotomy and Duadic Codes of Prime Lengths.
IEEE Trans. Inf. Theory, 1999
Several classes of binary sequences with three-level autocorrelation.
IEEE Trans. Inf. Theory, 1999
Generalized Cyclotomic Codes of Length p<sub>1</sub><sup>e<sup>1</sup></sup> ... p<sub>t</sub><sup>e<sup>t</sup></sup>.
IEEE Trans. Inf. Theory, 1999
Construction and Enumeration of All Binary Duadic Codes of Length p<sup>m</sup>.
Fundam. Informaticae, 1999
1998
On the Linear Complexity of Legendre Sequences.
IEEE Trans. Inf. Theory, 1998
Autocorrelation Values of Generalized Cyclotomic Sequences of Order Two.
IEEE Trans. Inf. Theory, 1998
Pattern Distributions of Legendre Sequences.
IEEE Trans. Inf. Theory, 1998
On Cyclotomic Generator of Order <i>r</i>.
Inf. Process. Lett., 1998
Linear Complexity of Some Generalized Cyclotomic Sequences.
Int. J. Algebra Comput., 1998
How to Build Robust Shared Control Systems.
Des. Codes Cryptogr., 1998
1997
Linear Multisecret-Sharing Schemes and Error-Correcting Codes.
J. Univers. Comput. Sci., 1997
TWOPRIME: A Fast Stream Ciphering Algorithm.
Proceedings of the Fast Software Encryption, 4th International Workshop, 1997
1996
On Cooperatively Distributed Ciphering and Hashing.
Comput. Artif. Intell., 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
