CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m

In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.     

Erased-Chase decoding for RS-coded MPSK signaling over a Rayleigh fading channel

In this paper, a novel dual-metric, the maximum and minimum Squared Euclidean Distance Increment （SEDI） Brought by changing the hard decision symbol, is introduced to measure the reliability of the received M-ary Phase Shift Keying （MPSK） symbols over a Rayleigh fading channel. Based on the dual-metric, a Chase-type soft decoding algorithm, which is called erased-Chase algorithm, is developed for Reed-Solomon （RS） coded MPSK schemes. The proposed algorithm treats the unreliable symbols with small maximum SEDI as erasures, and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure, much more reduction in the decoding complexity can be achieved. Simulation results of the RS（63, 42, 22）-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally, an adaptive scheme for the number of erasures is introduced into the decoding algorithm.     

Computerprogramm zur interaktiven Auswertung von 15N-tracerkinetischen Stoffwechselexperimenten

The theoretical concept of the computer program is based on the compartment theory for the 3-pool model using single pulse administration of the tracer. The code estimates the model parameters by means of the non-linear method of least squares fit under steady state conditions. Furthermore the parameters of the protein metabolism are calculated. The program works interactively and allows reading and modifying the experimental ¹⁵N tracer data via terminal and controlling the program.     

圭亚那乔治敦某五星级酒店暖通设计

详细介绍圭亚那乔治敦某五星级酒店空调系统在负荷计算、设备选型、空调系统自控、防排烟设计、LEED认证等设计情况。     

Performance of degree distribution based HARQ scheme for LDPC-coded OFDM system

This article studies the degree distribution property of low density parity check (LDPC) codes by Gaussian approximation (GA) and presents an efficient hybrid automatic repeat quest (HARQ) scheme for LDPC-coded orthogonal frequency division multiplexing (OFDM) system. In the scheme, the important bits with large degrees have high retransmission priorities and are mapped to the sub-carriers with better channel quality indicator (CQI) levels in the OFDM system. The new scheme provides more protection to the bits with large degrees and thus contributes more to the decoding process by offering more transmission power. In this way the system performance would be improved. The statistics and simulation results also prove the new scheme.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

Existence of Perfect 4-Deletion-Correcting Codes with Length Six

By a T ^*(2, k, v)-code we mean a perfect4-deletion-correcting code of length 6 over an alphabet of size v, which is capable of correcting anycombination of up to 4 deletions and/or insertions of letters that occur in transmission of codewords. Thethird author (DCC Vol. 23, No. 1) presented a combinatorial construction for such codes and prove thata T ^*(2, 6, v)-code exists for all positive integers v 3 (mod 5), with 12 possible exceptions of v. In this paper, the notion of a directedgroup divisible quasidesign is introduced and used to show that a T ^*(2, 6,v)-code exists for all positive integers v 3 (mod 5), except possiblyfor v {173, 178, 203, 208}. The 12 missing cases for T ^*(2,6, v)-codes with v 3 (mod 5) are also provided, thereby the existenceproblem for T ^*(2, 6, v)-codes is almost complete.     

The structure of linear codes of constant weight

In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.