Searcharxiv⌕ Search

arXiv subjects

Keqin Feng

Publications and source records attributed to Keqin Feng.

45 records · Page 3Linked to original sources

A Class of Linear Codes with a Few Weights

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of linear codes with a few weights over the finite field $\gf(p)$ are presented and their weight distributions are also determined, where $p$ is an odd prime. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes.

cs.IT↗

Multipartite entangled states, symmetric matrices and error-correcting codes

A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction via symmetric matrices and the second one through classical error-correcting codes. There are three main results arising from our constructions. Firstly, we show that for any given even $n\ge 2$, there always exists an $n/2$-uniform $n$-qudit quantum state of level $p$ for sufficiently large prime $p$. Secondly, both constructions show that their exist $k$-uniform $n$-qudit pure quantum states such that $k$ is proportional to $n$, i.e., $k=Ω(n)$ although the construction from symmetric matrices outperforms the one by error-correcting codes. Thirdly, our symmetric matrix construction provides a positive answer to the open question in \cite{DA} on whether there exists $3$-uniform $n$-qudit pure quantum state for all $n\ge 8$. In fact, we can further prove that, for every $k$, there exists a constant $M_k$ such that there exists a $k$-uniform $n$-qudit quantum state for all $n\ge M_k$. In addition, by using concatenation of algebraic geometry codes, we give an explicit construction of $k$-uniform quantum state when $k$ tends to infinity.

cs.IT↗

A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions

In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes $\tilde{\C}_{f}$ and $\C_f$ (see Theorem \ref{thm-maincode1} and Theorem \ref{thm-maincodenew}) over $\f_{2^t}$ from a Boolean function $f:\f_{q}\rightarrow \f_2$, where $q=2^n$ and $\f_{2^t}$ is some subfield of $\f_{q}$. The complete weight enumerator of $\tilde{\C}_{f}$ can be easily determined from the Walsh spectrum of $f$, while the weight distribution of the code $\C_f$ can also be easily settled. Particularly, the number of nonzero weights of $\tilde{\C}_{f}$ and $\C_f$ is the same as the number of distinct Walsh values of $f$. As applications of this construction, we show several series of linear codes over $\f_{2^t}$ with two or three weights by using bent, semibent, monomial and quadratic Boolean function $f$.

cs.IT↗

Relative Generalized Hamming Weights of Cyclic Codes

Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems. In this paper, we investigate the RGHWs of cyclic codes with two nonzeros respect to any of its irreducible cyclic subcodes. Applying the method in the paper [arxiv.org/abs/1410.2702], we give two formulae for RGHWs of the cyclic codes. As applications of the formulae, explicit examples are computed.

cs.IT↗

Generalized Hamming Weights of Irreducible Cyclic Codes

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on $d_r(C)$ for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy $\{d_1(C), d_2(C), \ldots, d_k(C)\}$ $(k=\dim C)$ are completely determined for several cases.

cs.IT↗

Multivariate Interpolation Formula over Finite Fields and Its Applications in Coding Theory

A multivariate interpolation formula (MVIF) over finite fields is presented by using the proposed Kronecker delta function. The MVIF can be applied to yield polynomial relations over the base field among homogeneous symmetric rational functions. Besides the property that all the coefficients are coming from the base field, there is also a significant one on the degrees of the obtained polynomial; namely, the degree of each term satisfies certain condition. Next, for any cyclic codes the unknown syndrome representation can also be provided by the proposed MVIF and also has the same properties. By applying the unknown syndrome representation and the Berlekamp-Massey algorithm, one-step decoding algorithms can be developed to determine the error locator polynomials for arbitrary cyclic codes.

cs.IT↗

Bounds on and Constructions of Unit Time-Phase Signal Sets

Digital signals are complex-valued functions on $\Z_n$. Signal sets with certain properties are required in various communication systems. Traditional signal sets consider only the time distortion during transmission. Recently, signal sets against both the time and phase distortion have been studied, and are called {\em time-phase} signal sets. Several constructions of time-phase signal sets are available in the literature. There are a number of bounds on time signal sets (also called codebooks). They are automatically bounds on time-phase signal sets, but are bad bounds. The first objective of this paper is to develop better bounds on time-phase signal sets from known bounds on time signal sets. The second objective of this paper is to construct two series of time-phase signal sets, one of which is optimal.

cs.IT↗