1-15hit |
In this paper, we study self-dual cyclic codes of length n over the ring R=Z4[u]/
Young-Sik KIM Hosung PARK Sang-Hyo KIM
To construct good DNA codes based on biologically motivated constraints, it is important that they have a large minimum Hamming distance and the number of GC-content is kept constant. Also, maximizing the number of codewords in a DNA code is required for given code length, minimum Hamming distance, and number of GC-content. In most previous works on the construction of DNA codes, quaternary constant weight codes were directly used because the alphabet of DNA strands is quaternary. In this paper, we propose new coding theoretic constructions of DNA codes based on the binary Hadamard matrix from a binary sequence with ideal autocorrelation. The proposed DNA codes have a greater number of codewords than or the equal number to existing DNA codes constructed from quaternary constant weight codes. In addition, it is numerically shown that for the case of codes with length 8 or 16, the number of codewords in the proposed DNA code sets is the largest with respect to the minimum reverse complementary Hamming distances, compared to all previously known results.
Minjia SHI Ting YAO Adel ALAHMADI Patrick SOLÉ
In this article, we study skew cyclic codes over $R=mathbb{F}_{q}+vmathbb{F}_{q}+v^{2}mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and v3=v. We describe the generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over R by a decomposition theorem. We also describe the generator polynomial of the dual of a skew cyclic code over R. Moreover, the idempotent generators of skew cyclic codes over $mathbb{F}_{q}$ and R are considered.
In this short correspondence, (1+uv)-constacyclic codes over the finite non-chain ring R[v]/(v2+v) are investigated, where R=F2+uF2 with u2=0. Some structural properties of this class of constacyclic codes are studied. Further, some optimal binary linear codes are obtained from these constacyclic codes.
Fanxin ZENG Xiaoping ZENG Zhenyu ZHANG Guixin XUAN
A unified construction for transforming binary sequences of balance or unbalance into quaternary sequences is presented. On the one hand, when optimal and balanced binary sequences with even period are employed, our construction is exactly the same Jang, et al.'s and Chung, et al.'s ones, which result in balanced quaternary sequences with optimal autocorrelation magnitude. On the other hand, when ideal and balanced binary sequences with odd period N are made use of, our construction produces new balanced quaternary sequences with optimal autocorrelation value (OAV), in which there are N distinct sequences in terms of cyclic shift equivalence, and includes Tang, et al.'s and Jang, et al.'s ones as special cases. In addition, when binary sequences without period 2n-1 or balance are employed, the transformation of Jang, et al.'s method is invalid, however, the proposed construction works very good. As a consequence, this unified construction allows us to construct optimal and balanced quaternary sequences from ideal/optimal balanced binary sequences with arbitrary period.
Xuan ZHANG Jing QIN Qiaoyan WEN Jie ZHANG
In this paper, we introduce a construction of 16-QAM sequences based on known binary sequences using multiple sequences, interleaved sequences and Gray mappings. Five kinds of binary sequences of period N are put into the construction to get five kinds of new 16-QAM sequences of period 4N. These resultant sequences have 5-level autocorrelation {0, ±8, ±8N}, where ±8N happens only once each. The distributions of the periodic autocorrelation are also given. These will provide more choices for many applications.
Fanxin ZENG Xiaoping ZENG Zhenyu ZHANG Guixin XUAN
The approximately synchronized code-division multiple-access (CDMA) communication system, using the QAM sequences with zero correlation zone (ZCZ) as its spreading sequences, not only can remove the multiple access interference (MAI) and multi-path interference (MPI) synchronously, but also has a higher transmission data rate than the one using traditional ZCZ sequences with the same sequence length. Based on Gray mapping and the known binary ZCZ sequences, in this letter, six families of 16-QAM sequences with ZCZ are presented. When the binary ZCZ sequences employed by this letter arrive at the theoretical bound on the binary ZCZ sequences, and their family size is a multiple of 4 or 2, two of the resultant six 16-QAM sequence sets satisfy the bound referred to above as well.
Chengqian XU Yubo LI Kai LIU Gang LI
In this correspondence, a new method to extend the number of quaternary low correlation zone (LCZ) sequence sets is presented. Based on the inverse Gray mapping and a binary sequence with ideal two-level auto-correlation function, numbers of quaternary LCZ sequence sets can be generated by choosing different parameters. There is at most one sequence cyclically equivalent in different LCZ sequence sets. The parameters of LCZ sequence sets are flexible.
Taehyung LIM Jong-Seon NO Habong CHUNG
In this paper, a new construction method of quaternary sequences of even period 2N having the ideal autocorrelation and balance properties is proposed. These quaternary sequences are constructed by applying the inverse Gray mapping to binary sequences of odd period N with the ideal autocorrelation. Autocorrelation distribution of the proposed quaternary sequences is derived. These sequences can be used to construct quaternary sequence families of even period 2N. Family size and the maximum absolute value of correlation spectrum of the proposed quaternary sequence families are also derived.
A generalized Gray map for codes over the ring Fq[u]/
Jin-Ho CHUNG Yun Kyoung HAN Kyeongcheol YANG
In this paper we present a construction method for quaternary sequences from a binary sequence of even period, which preserves the period and autocorrelation of the given binary sequence. By applying the method to the binary sequences with three-valued autocorrelation, we construct new quaternary sequences with three-valued autocorrelation, which are balanced or almost balanced. In particular, we construct new balanced quaternary sequences whose autocorrelations are three-valued and have out-of-phase magnitude 2, when their periods are N=pm-1 and N≡ 2 (mod 4) for any odd prime p and any odd integer m. Their out-of-phase autocorrelation magnitude is the known optimal value for N≠ 2,4,8, and 16.
A quaternary sequence is constructed by Gray mapping of a binary sequence with even period and its shift. The autocorrelation of the new quaternary sequence is the same as that of the binary sequence employed. Quaternary sequences with the maximum autocorrelation 2 can be obtained by the construction for period N≡ 2 ( mod 4).
Jianfa QIAN Wenping MA Xinmei WANG
We introduce (1-γ)-cyclic code and cyclic codes over the finite chain ring R. We prove that the Gray image of a linear (1-γ)-cyclic code over R of length n is a distance invariant quasi-cyclic code over Fpk. We also prove that if (n,p)=1, then every code over Fpk which is the Gray image of a cyclic code over R of length n is equivalent to a quasi-cyclic code.
Jian-Fa QIAN Li-Na ZHANG Shi-Xin ZHU
A new Gray map between codes over F2+uF2+u2F2 and codes over F2 is defined. We prove that the Gray image of a linear (1-u2)-cyclic code over F2+uF2+u2F2 of length n is a binary distance invariant linear quasi-cyclic code. We also prove that, if n is odd, then every binary code which is the Gray image of a linear cyclic code over F2+uF2+u2F2 of length n is equivalent to a quasi-cyclic code.
Probabilistic encryption becomes more and more important since its ability to against chosen-ciphertext attack. Applications like online voting schemes and one-show credentials are based on probabilistic encryption. Research on good probabilistic encryptions are on going, while many good deterministic encryption schemes are already well implemented and available in many systems. To convert any deterministic encryption scheme into a probabilistic encryption scheme, a randomized media is needed to apply on the message and carry the message over as an randomized input. In this paper, nonlinear codes obtained by certain mapping from linear error-correcting codes are considered to serve as such carrying media. Binary nonlinear codes obtained by Gray mapping from