arXiv subjects
Publications and source records attributed to Yun Fan.
Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois self-dual and isometrically Galois self-dual constacyclic codes are obtained. As consequences, the results on self-dual, iso-dual and Hermitian self-dual constacyclic codes are derived.
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a prime or a square of a prime and the maximal cycle generates a normal subgroup, then it is similar to a permutation matrix group. In this paper, we prove that if a permutation-like matrix group contains a maximal cycle of length equal to any power of any odd prime and the maximal cycle generates a normal subgroup, then it is similar to a permutation matrix group.
We introduce quasi-cyclic codes of index 1.5, construct such codes in terms of polynomials and matrices; and prove that the quasi-cyclic codes of index 1.5 are asymptotically good.
Let $G$ be a finite group and let $F$ be a finite field of characteristic $2$. We introduce \emph{$F$-special subgroups} and \emph{$F$-special elements} of $G$. In the case where $F$ contains a $p$th primitive root of unity for each odd prime $p$ dividing the order of $G$ (e.g. it is the case once $F$ is a splitting field for all subgroups of $G$), the $F$-special elements of $G$ coincide with real elements of odd order. We prove that a symmetric $FG$-module $V$ is hyperbolic if and only if the restriction $V_D$ of $V$ to every $F$-special subgroup $D$ of $G$ is hyperbolic, and also, if and only if the characteristic polynomial on $V$ defined by every $F$-special element of $G$ is a square of a polynomial over $F$. Some immediate applications to characters, self-dual codes and Witt groups are given.
For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier of a Type I polyadic constacyclic code is given. As an application, some optimal codes from Type I polyadic constacyclic codes, including generalized Reed-Solomon codes and alternant MDS codes, are constructed.
Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot et al. [6,7] via Fourier transforms of functions on $G$. In this paper we introduce the so-called $G$-dual set $\widehat X$ of $X$, which plays the role similar to the dual group $\widehat G$ of $G$, and the Fourier transforms of functions on $X$, a generalization of the Fourier transforms of functions on finite abelian groups. Then we characterize the bent functions on $X$ in terms of their own Fourier transforms on $\widehat X$. Bent (perfect nonlinear) functions on finite abelian groups and $G$-bent ($G$-perfect nonlinear) functions on $X$ are treated in a uniform way in this paper, and many known results in [4,2,6,7] are obtained as direct consequences. Furthermore, we will prove that the bentness of a function on $X$ can be determined by its distance from the set of $G$-linear functions. In order to explain the main results clearly, examples are also presented.
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.
A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle and the matrix dimension is a prime, then the group is similar to a permutation matrix group. This paper extends the result to the case where the matrix dimension is a square of a prime.
For a random quasi-abelian code of rate $r$, it is shown that the GV-bound is a threshold point: if $r$ is less than the GV-bound at $δ$, then the probability of the relative distance of the random code being greater than $δ$ is almost 1; whereas, if $r$ is bigger than the GV-bound at $δ$, then the probability is almost 0. As a consequence, there exist many asymptotically good quasi-abelian codes with any parameters attaining the GV-bound.
The homogeneous weights and the Möbius functions and Euler phi-functions on finite rings are discussed; some computational formulas for these functions on finite principal ideal rings are characterized; for the residue rings of integers, they are reduced to the classical number-theoretical Möbius functions and the classical number-theoretical Euler phi-functions.
In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite field and $\ell$ is a prime different from $p$.
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp threshold point for the density of the linear codes whose relative distance is greater than a given positive number. For arbitrary random codes, similar settings and results are exhibited; in particular, the very sharp threshold point for the density of the codes whose relative distance is greater than a given positive number is located at half the asymptotic Gilbert-Varshamov bound.
The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the other one is from the point of view of the Galois group of the coefficient field.