Xiang-dong Hou

Finite Fields Their Appl., January, 2024

More on the sum-freedom of the multiplicative inverse function.

[BibT_eX]

[DOI]

Claude Carlet

,

CoRR, 2024

In Memory of Professor Zhexian Wan.

[BibT_eX]

[DOI]

,

,

,

,

Finite Fields Their Appl., December, 2023

New results on permutation binomials of finite fields.

[BibT_eX]

[DOI]

Vincenzo Pallozzi Lavorante

,

Finite Fields Their Appl., June, 2023

A general construction of permutation polynomials of Fq2.

[BibT_eX]

[DOI]

Vincenzo Pallozzi Lavorante

,

Finite Fields Their Appl., 2023

On the Number of Affine Equivalence Classes of Boolean Functions and q-Ary Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On a conjecture on permutation rational functions over finite fields.

[BibT_eX]

[DOI]

Daniele Bartoli

,

Finite Fields Their Appl., 2021

On the Tu-Zeng permutation trinomial of type (1∕4, 3∕4).

[BibT_eX]

[DOI]

Discret. Math., 2021

A power sum formula by Carlitz and its applications to permutation rational functions of finite fields.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2021

Determination of a class of permutation trinomials in characteristic three.

[BibT_eX]

[DOI]

,

Ziran Tu

,

Xiangyong Zeng

Finite Fields Their Appl., 2020

On a type of permutation rational functions over finite fields.

[BibT_eX]

[DOI]

,

Christopher Sze

Finite Fields Their Appl., 2020

More permutation polynomials with Niho exponents which permute Fq2.

[BibT_eX]

[DOI]

,

,

,

Finite Fields Their Appl., 2020

The Möbius function of the affine linear group AGL (1, Fq).

[BibT_eX]

[DOI]

Discret. Math., 2020

The Fifth International Students' Olympiad in cryptography - NSUCRYPTO: Problems and their solutions.

[BibT_eX]

[DOI]

Anastasiya Gorodilova

,

,

,

,

,

,

,

,

,

,

,

,

Cryptologia, 2020

On the Number of Affine Equivalence Classes of Boolean Functions.

[BibT_eX]

[DOI]

CoRR, 2020

On a conjecture of Fernando, Hou and Lappano concerning permutation polynomials over finite fields.

[BibT_eX]

[DOI]

Wun-Seng Chou

,

Finite Fields Their Appl., 2019

Optimal binary constant weight codes and affine linear groups over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

On a class of permutation trinomials in characteristic 2.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

Applications of the Hasse-Weil bound to permutation polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2018

Complexities of normal bases constructed from Gauss periods.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Proof of a conjecture on monomial graphs.

[BibT_eX]

[DOI]

,

Stephen D. Lappano

,

Felix Lazebnik

Finite Fields Their Appl., 2017

From r-linearized polynomial equations to rm-linearized polynomial equations.

[BibT_eX]

[DOI]

,

Finite Fields Their Appl., 2016

Switchings of semifield multiplications.

[BibT_eX]

[DOI]

,

Ferruh Özbudak

,

Yue Zhou

Des. Codes Cryptogr., 2016

Determination of a type of permutation trinomials over finite fields, II.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Permutation polynomials over finite fields - A survey of recent advances.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Lattice of ideals of the polynomial ring over a commutative chain ring.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2015

Permutation polynomials over finite fields involving x + xp + ... + xqa-1.

[BibT_eX]

[DOI]

,

,

Stephen D. Lappano

Discret. Math., 2014

Proof of a conjecture on permutation polynomials over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2013

A new approach to permutation polynomials over finite fields, II.

[BibT_eX]

[DOI]

,

,

Stephen D. Lappano

Finite Fields Their Appl., 2013

Galkin Quandles, Pointed Abelian Groups, and Sequence A000712.

[BibT_eX]

[DOI]

William Edwin Clark

,

Electron. J. Comb., 2013

Sums of Reciprocals of Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Kenneth Hicks

,

,

Gary L. Mullen

Am. Math. Mon., 2012

A new approach to permutation polynomials over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2012

A piecewise construction of permutation polynomials over finite fields.

[BibT_eX]

[DOI]

,

Finite Fields Their Appl., 2012

Classification of self dual quadratic bent functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

Counting Partial Spread Functions in Eight Variables.

[BibT_eX]

[DOI]

Philippe Langevin

,

IEEE Trans. Inf. Theory, 2011

Two classes of permutation polynomials over finite fields.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Enumeration of AGL(m/3, double struck capital Fp³)-invariant extended cyclic codes.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2010

Necessary conditions for reversed Dickson polynomials to be permutational.

[BibT_eX]

[DOI]

,

Tue Ly

Finite Fields Their Appl., 2010

On certain diagonal equations over finite fields.

[BibT_eX]

[DOI]

,

Christopher Sze

Finite Fields Their Appl., 2009

Reversed Dickson polynomials over finite fields.

[BibT_eX]

[DOI]

,

,

,

Finite Fields Their Appl., 2009

Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields.

[BibT_eX]

[DOI]

,

Gary L. Mullen

Finite Fields Their Appl., 2009

On the dual of a Coulter-Matthews bent function.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

On the Number of Inequivalent Binary Self-Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On the asymptotic number of inequivalent binary self-dual codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Explicit evaluation of certain exponential sums of binary quadratic functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2007

On the asymptotic number of non-equivalent binary linear codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2007

The affinity of a permutation of a finite vector space.

[BibT_eX]

[DOI]

William Edwin Clark

,

,

Alec Mihailovs

Finite Fields Their Appl., 2007

Affinity of permutations of P2n.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

On the asymptotic number of non-equivalent q-ary linear codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2005

Enumeration of certain affine invariant extended cyclic codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2005

A note on the proof of a theorem of Katz.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2005

A Note on the Proof of Niho's Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

p-Ary and q-ary versions of certain results about bent functions and resilient functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2004

Rings and constructions of partial difference sets.

[BibT_eX]

[DOI]

Discret. Math., 2003

On Binary Resilient Functions.

[BibT_eX]

Des. Codes Cryptogr., 2003

Group Actions on Binary Resilient Functions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

The eigenmatrix of the linear association scheme on R(2, m).

[BibT_eX]

[DOI]

Discret. Math., 2001

Bent Functions, Partial Difference Sets, and Quasi-Frobenius Local Rings.

[BibT_eX]

Des. Codes Cryptogr., 2000

The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2.

[BibT_eX]

[DOI]

,

Jyrki T. Lahtonen

,

Sami Koponen

IEEE Trans. Inf. Theory, 1998

Cubic bent functions.

[BibT_eX]

[DOI]

Discret. Math., 1998

On the norm and covering radius of the first-order Reed-Muller codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Results on Bent Functions.

[BibT_eX]

[DOI]

,

Philippe Langevin

J. Comb. Theory A, 1997

The Reed-Muller Code R(1, 7) Is Normal.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

On the covering radius of R(1, m) in R(3, m).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Covering Radius of the Reed-Muller CodeR(1, 7) - A Simpler Proof.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

GL(m, 2) acting on R(r, m)/R(r-1, m).

[BibT_eX]

[DOI]

Discret. Math., 1996

The Covering Radius of R(1, 9) in R(4, 9).

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1996

Classification of cosets of the Reed-Muller code R(m-3, m).

[BibT_eX]

[DOI]

Discret. Math., 1994

Some results on the covering radii of Reed-Muller codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Further Results on the Covering Radii of the Reed-Muller Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1993

On theG-matrices with entries and eigenvalues inQ(i).

[BibT_eX]

[DOI]

Graphs Comb., 1992

Some Inequalities about the Covering Radius of Reed-Muller Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1992

On the covering radius of subcodes of a code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Binary linear quasi-perfect codes are normal.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

An improved sphere covering bound for the codes with n = 3R + 2.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

New lower bounds for covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Some results on the norm of codes.

[BibT_eX]

[DOI]