High precision Zernike modal gray map reconstruction for liquid crystal corrector

This paper proposes a new Zernike modal gray map reconstruction algorithm used in the nematic liquid crystal adaptive optics system. Firstly, the new modal algorithm is described. Secondly, a single loop correction experiment was conducted, and it showed that the modal method has a higher precision in gray map reconstruction than the widely used slope method. Finally, the contrast close-loop correction experiment was conducted to correct static aberration in the laboratory. The experimental results showed that the average peak to valley （PV） and root mean square （RMS） of the wavefront corrected by mode method were reduced from 2.501A （λ= 633 nm） and 0.610A to 0.0334λ and 0.00845A, respectively. The corrected PV and RMS were much smaller than those of 0.173A and 0.048A by slope method. The Strehl ratio and modulation transfer function of the system corrected by mode method were much closer to diffraction limit than with slope method. These results indicate that the mode method can take good advantage of the large number of pixels of the liquid crystal corrector to realize high correction precision.

An Adjusted Gray Map Technique for Constructing Large Four-Level Uniform Designs

A uniform experimental design(UED)is an extremely used powerful and efficient methodology for designing experiments with high-dimensional inputs,limited resources and unknown underlying models.A UED enjoys the following two significant advantages:(i)It is a robust design,since it does not require to specify a model before experimenters conduct their experiments;and(ii)it provides uniformly scatter design points in the experimental domain,thus it gives a good representation of this domain with fewer experimental trials(runs).Many real-life experiments involve hundreds or thousands of active factors and thus large UEDs are needed.Constructing large UEDs using the existing techniques is an NP-hard problem,an extremely time-consuming heuristic search process and a satisfactory result is not guaranteed.This paper presents a new effective and easy technique,adjusted Gray map technique(AGMT),for constructing(nearly)UEDs with large numbers of four-level factors and runs by converting designs with s two-level factors and n runs to(nearly)UEDs with 2^(t−1)s four-level factors and 2tn runs for any t≥0 using two simple transformation functions.Theoretical justifications for the uniformity of the resulting four-level designs are given,which provide some necessary and/or sufficient conditions for obtaining(nearly)uniform four-level designs.The results show that the AGMT is much easier and better than the existing widely used techniques and it can be effectively used to simply generate new recommended large(nearly)UEDs with four-level factors.

Some Constacyclic Codes over Z4[u]/〈u^2〉, New Gray Maps, and New Quaternary Codes

In this paper, we study λ-constacyclic codes over the ring R = Z4 ＋ uZ4, where u^2 = 0, for λ= 1 ＋ 3u and 3 ＋ u. We introduce two new Gray maps from R to Z4^4 and show that the Gray images of λ-constacyclic codes over R are quasi-cyclic over Z4. Moreover, we present many examples of λ-constacyclic codes over R whose Z4-images have better parameters than the currently best-known linear codes over Z4.

A Unified Bit-to-Symbol Mapping for Generalized Constellation Modulation

Gray mapping is a well-known way to improve the performance of regular constellation modulation,but it is challenging to be applied directly for irregular alternative.To address this issue,in this paper,a unified bit-to-symbol mapping method is designed for generalized constellation modulation(i.e.,regular and irregular shaping).The objective of the proposed approach is to minimize the average bit error probability by reducing the hamming distance(HD)of symbols with larger values of pairwise error probability.Simulation results show that the conventional constellation modulation(i.e.,phase shift keying and quadrature amplitude modulation(QAM)with the proposed mapping rule yield the same performance as that of classical gray mapping.Moreover,the recently developed golden angle modulation(GAM)with the proposed mapping method is capable of providing around1 d B gain over the conventional mapping counterpart and offers comparable performance to QAM with Gray mapping.

Duadic Codes over the Ring Fq[u] /m- and Their Gray Images

Let m ≥ 2 be any natural number and let be a finite non-chain ring, where and q is a prime power congruent to 1 modulo (m-1). In this paper we study duadic codes over the ring and their extensions. A Gray map from to is defined which preserves self duality of linear codes. As a consequence self-dual, formally self-dual and self-orthogonal codes over are constructed. Some examples are also given to illustrate this.

Gray Images of Constacyclic Codes over a Non-chain Extension of Z_(4)

Let Z_(4) be the ring of integers modulo 4.We study the Λ-constacyclic and(θ,Λ)-cyclic codes over the non-chain ring R=Z_(4)[u,v]/<u^(2)=1,v^(2)=0,uv=vu=0>for a unit Λ=1+2u+2v in R.We define several Gray maps and find that the respective Gray images of a quasi-cyclic code over Z_(4) are cyclic,quasi-cyclic or permutation equivalent to this code.For an odd positive integer n,we determine the generator polynomials of cyclic and Λ-constacyclic codes of length n over R.Further,we prove that a(θ,Λ)-cyclic code of length n is a Λ-constacyclic code if n is odd,and a Λ-quasi-twisted code if n is even.A few examples are also incorporated,in which two parameters are new and one is best known to date.

CONSTACYCLIC CODES OF ARBITRARY LENGTHS OVER RING Z_(p^m) +vZ_(p^m)

By constructing a Gray map, constacyclic codes of arbitrary lengths over ring R =Z p m +vZ pmare studied, wherev 2=v. The structure of constacyclic codes over R and their dual codes are obtained. A necessary and sufficient condition for a linear code to be self-dual constacyclic is given. In particular,(1 +(v +1)ap)-constacyclic codes over R are classified in terms of generator polynomial, where a is a unit of Z m.

Cyclic Co des over F2＋uF2＋v F2

We study the structure of cyclic codes of an arbitrary length n over the ring F2+ uF2+ vF2, which is not a finite chain ring. We prove that the Gray image of a cyclic code length n over F2+ uF2+ vF2 is a 3-quasi-cyclic code length 3n over F2.

On the Characterization of Cyclic Co des over Ring F2＋uF2＋v F2

In this work, we investigate the cyclic codes over the ring F2+ uF2+ vF2. We first study the relationship between linear codes over F2+ uF2+ vF2 and that over F2.Then we give a characterization of the cyclic codes over F2+ uF2+ vF2. Finally, we obtain the number of the cyclic code over F2+ uF2+ vF2 of length n.

THE BINARY IMAGE OF THE DUAL OF QUATERNARY GOETHALS CODE

The 2-adic representations of codewords of the dual of quaternary Goethals code are given. By the 2-adic representations, the binary image of the dual of quaternary Goethals code under the Gray map is proved to be the nonlinear code constructed by Goethals in 1976.

Polyadic Cyclic Codes over a Non-Chain Ring

Let f(u) and g(v) be two polynomials of degree k and l respectively, not both linear which split into distinct linear factors over Fq. Let be a finite commutative non-chain ring. In this paper, we study polyadic codes and their extensions over the ring R. We give examples of some polyadic codes which are optimal with respect to Griesmer type bound for rings. A Gray map is defined from which preserves duality. The Gray images of polyadic codes and their extensions over the ring R lead to construction of self-dual, isodual, self-orthogonal and complementary dual (LCD) codes over Fq. Some examples are also given to illustrate this.

Construction of One-Gray Weight Codes and Two-Gray Weight Codes over Z4+uZ4

This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over Z_4 +uZ_4(u^2=u) with type 16^(k_1)8^(k_2)8^(k_3)4^(k_4)4^(k_5)4^(k_6)2^(k_7)2^(k_8) based on a distance-preserving Gray map from(Z4 + u Z4)n to Z2n4. Secondly, the authors use the similar approach to do works on two-Gray(projective) weight linear codes. Finally, some examples are given to illustrate the construction methods.

On the Gray Images of Some Constacyclic Codes over Fp ＋ uFp ＋ u^2Fp

Abstract Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp ＋ uFp ＋ u^2Fp and codes over Fp is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear （1 ＋ u ＋ u2）-constacyclic code over Fp ＋ uFp ＋ u^2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from （1 ＋ u ＋ u2）-constacyclic codes over F3 ＋ uF3 ＋ u^2F3 are given.

OPTIMAL BINARY CODES FROM ONE-LEE WEIGHT CODES AND TWO-LEE WEIGHT PROJECTIVE CODES OVER Z_4

This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4.The authors first give the Pless identities on the Lee weight of linear codes over Z_4.Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively,the construction methods of one-Lee weight and two-Lee weight projective codes over Z4 are also given.Finally,the authors recall the weight-preserving Gray map from(Z_4~n,Lee weight)to(F_2^(2n),Hamming weight),and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes,which reach the Plotkin bound and the Griesmer bound.

A FAMILY OF CONSTACYCLIC CODES OVER F_2+μF_2+ vF_2+ uvF_2

This paper studies （1 ＋ u）-constacyelic codes over the ring F2 ＋ uF2 ＋ vF,2 ＋ uvF2. It is proved that the image of a （1 ＋ u）-constacyclic code of length n over F2 ＋ uF2 ＋ vF2 ＋uvF2 under a Gray map is a distance invariant binary quasi-cyclic code of index 2 and length 4n. A set of generators of such constacyclic codes for an arbitrary length is determined, Some optimal binary codes are obtained directly from （1 ＋ u）-constacyclic codes over F2 ＋ uF2 ＋ vF2 ＋ uvF2.

Optimal p-Ary Codes from One-Weight and Two-Weight Codes over IF_p+ vIF_p

This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.

(1-uv)-CONSTACYCLIC CODES OVER F_p+uF_p+vF_p+uvF_p

Constacyclic codes are an important class of linear codes in coding theory.Many optimal linear codes are directly derived from constacyclic codes.In this paper,(1 — uv)-constacyclic codes over the local ring F_p + uF_p + vF_p + uvF_p are studied.It is proved that the image of a(1 — uv)-constacyclic code of length n over F_p + uF_p + vF_p + uvF_p under a Gray map is a distance invariant quasi-cyclic code of index p2 and length p^3n over F_p.Several examples of optimal linear codes over F_p from(1 — uv)-constacyclic codes over F_p + uF_p + vF_p + uvF_p are given.

Construction of One-Lee Weight and Two-Lee Weight Codes over IF_p+vIF_p

This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~n, Lee weight) to(IF_p^(2 n), Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p=2.

Constacyclic and cyclic codes over finite chain rings

The problem of Gray image of constacyclic code over finite chain ring is studied. A Gray map between codes over a finite chain ring and a finite field is defined. The Gray image of a linear constacyclic code over the finite chain ring is proved to be a distance invariant quasi-cyclic code over the finite field. It is shown that every code over the finite field, which is the Gray image of a cyclic code over the finite chain ring, is equivalent to a quasi-cyclic code.

Performance evaluation for PCC-OFDM systems impaired by carrier frequency offset over AWGN channels

Orthogonal frequency division multiplexing （OFDM） is sensitive to carrier frequency offset （CFO）, which destroys the orthogonality and causes inter-carrier interference （ICI）. ICI self-cancellation schemes based on polynomial cancellation coding （PCC-OFDM） can evidently reduce the sensitivity to CFO. In this paper, we analyze the performance of PCC-OFDM systems impaired by CFO over additive white gaussian noise （AWGN） channels. Two criteria are used to evaluate the effect of CFO on performance degradations. Firstly, the closed-form expressions of the average carrier-to-interference power ratio （CIR） and the statistical average ICI power, both of which reflect the desired power loss, are presented. Simulation and analytical results show that the theoretical expressions depend crucially on the normalized frequency offset and are hardly relevant to the number of subcarriers. Secondly, by exploiting the properties of the Beaulieu series, the effect of CFO on symbol error rate （SER） and bit error rate （BER） performance for PCC-OFDM systems are exactly expressed as the sum of an infinite series in terms of the charac- teristic function （CHF） of ICI. We consider the systems modulated with binary phase shift keying （BPSK）, quadrature PSK （QPSK）, 8-ary PSK （8-PSK）, and 16-ary quadrature amplitude modulation （16-QAM）, and all above modulation schemes are mapped with Gray codes for the evaluations of BER.