共查询到20条相似文献,搜索用时 0 毫秒
1.
Blackford T. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(6):1417-1424
This paper generalizes the results from Wolfmann (see ibid., vol.45, p.2527-2532, Nov. 1999 and vol.47, p.1773-1779, July 2001), classifying all negacyclic codes over Z/sub 4/ of even length using a transform approach. It is then shown which linear binary cyclic codes are images of negacyclic codes under the Gray map. In the process, the concatenated structure of both negacyclic codes and binary repeated-root cyclic codes is given. 相似文献
2.
Katz D.J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(3):964-985
A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic codes is proved in this paper by means of counting polynomial techniques introduced by Wilson along with a technique known as trace-averaging introduced here. The original theorem of McEliece concerned cyclic codes over prime fields. Delsarte and McEliece later extended this to Abelian codes over finite fields. Calderbank, Li, and Poonen extended McEliece's original theorem to cover cyclic codes over the rings Zopf2 d, Wilson strengthened their results and extended them to cyclic codes over Zopf p d, and Katz strengthened Wilson's results and extended them to Abelian codes over Zopfp d. It is natural to ask whether there is a single analogue of McEliece's theorem which correctly captures the behavior of codes over all finite fields and all rings of integers modulo prime powers. In this paper, this question is answered affirmatively: a single theorem for Abelian codes over Galois rings is presented. This theorem contains all previously mentioned results and more 相似文献
3.
Kiran T. Rajan B.S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(2):367-380
We study n-length consta-Abelian codes (a generalization of the well-known Abelian codes and constacyclic codes) over Galois rings of characteristic p/sup a/, where n and p are coprime. A twisted discrete Fourier transform (DFT) is used to generalize transform domain results of Abelian and constacyclic codes, to consta-Abelian codes. Further, we characterize consta-Abelian codes invariant under two kinds of monomials, whose underlying permutations are effected by: i) multiplying the coordinates with a unit in the appropriate mixed-radix representation of the coordinate positions and ii) shifting the coordinates by t positions. All the codes studied here belong to the class of quasi-twisted codes which are known to contain some good codes. We show that the dual of a consta-Abelian code invariant under the two monomials is also a consta-Abelian code closed under both monomials. 相似文献
4.
Abualrub T. Oehmke R. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(9):2126-2133
Results are presented on the generators of ideals in the ring /spl Zopf//sub 4/[x]/(x/sup n/-1). In particular, each ideal (cyclic code) has a unique distinguished set of generators that characterizes any cyclic code. Some results about dual codes are also included. 相似文献
5.
The author proposes shortened cyclic codes over GF(2/sup 8/), designed to provide additional error protection from both random as well as burst errors, for data consisting of 8-bit bytes, all having even (or odd) parity (e.g. ASCII characters). A specific code of length 29 bytes is described in detail.<> 相似文献
6.
Fagnani F. Zampieri S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2001,47(6):2256-2274
Convolutional codes over rings are particularly suitable for representing codes over phase-modulation signals. In order to develop a complete structural analysis of this class of codes, it is necessary to study rational matrices over rings, which constitutes the generator matrices (encoders) for such convolutional codes. Noncatastrophic, minimal, systematic, and basic generator matrices are introduced and characterized by using a canonical form for polynomial matrices over rings. Finally, some classes of convolutional codes, defined according to the generator matrix they admit, are introduced and analyzed from a system-theoretic point of view 相似文献
7.
研究了形式幂级数环与有限链环上的循环码与负循环码,利用环同构与交换图技术得到这2类环上循环码与负循环码,以及Dougherty等得到的形式幂级数环上的循环码的投影码也是循环码的结果,给出了形式幂级数环上码为循环码的一个充要条件。借助这一条件,得到了含有形式幂级数环的中国积中循环码的投影码的循环性。 相似文献
8.
Unique sets of 2/sup n/ phase coded pulses are introduced. Derived from any phase code, using simple transformations, these codes possess the useful property that the sum of all possible cross-correlations added to the sum of all autocorrelations within a set produces a pulse compressed signal. This signal has a peak to sidelobe ratio equal to that for the autocorrelation function of the original untransformed code.<> 相似文献
9.
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. 相似文献
10.
Cyclic and negacyclic codes over finite chain rings 总被引:9,自引:0,他引:9
Hai Quang Dinh Lopez-Permouth S.R. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(8):1728-1744
The structures of cyclic and negacyclic codes of length n and their duals over a finite chain ring R are established when n is not divisible by the characteristic of the residue field R~. Some cases where n is divisible by the characteristic of the residue field R~ are also considered. Namely, the structure of negacyclic codes of length 2/sup t/ over /spl Zopf//sub 2//sup m/ and that of their duals are derived. 相似文献
11.
Dey B.K. Rajan B.S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(4):691-698
Recently, Blackford and Ray-Chaudhuri used transform domain techniques to permutation groups of cyclic codes over Galois rings. They used the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length 2/sup m/ over any subring of GR(4,m) to be affine invariant. Here, we use the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length p/sup m/ over any subring of GR(p/sup e/,m) to be affine invariant, for e=2 with arbitrary p and for p=2 with arbitrary e. These are used to find two new classes of affine invariant Bose-Chaudhuri-Hocquenghem (BCH) and generalized Reed-Muller (GRM) codes over Z/sub 2//sup e/ for arbitrary e and a class of affine invariant BCH codes over Z/sub p//sup 2/ for arbitrary prime p. 相似文献
12.
We have generated binary images of a large number of shortened cyclic (8, 5) codes over GF(2/sup 8/) and have computed weight distributions of the binary images of the codes. Based on the weight distributions, we have chosen four codes with the largest minimum weight 8 and the second largest minimum weight 7 among the generated codes. Over an additive white Gaussian noise channel with binary phase-shift keying modulation, simulation results have shown that block error rates of the chosen codes by a soft-decision decoding based on order-2 reprocessing are smaller than those of (64, 40) subcodes of Reed-Muller (64, 42) code by maximum likelihood decoding. 相似文献
13.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(3):683-694
The standard decoding procedure for alternant codes over fields centers on solving a key equation which relates an error locator polynomial and an error evaluator polynomial by a syndrome sequence. We extend this technique to decode alternant codes over Galois rings. We consider the module M={(a, b): as≡b mod xr} of all solutions to the key equation where s is the syndrome polynomial and r, is the number of rows in a parity-check matrix for the code. In decoding we seek a particular solution (Σ, Ω)∈M which we prove can be found in a Grobner basis for M. We present an iterative algorithm which generates a Grobner basis modulo xk+1 from a given basis modulo xk. At the rth step, a Grobner basis for M is found, and the required solution recovered 相似文献
14.
Junying Pei Jie Cui Sanyang Liu 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(3):749-758
Let GR(4/sup m/) be the Galois ring of characteristic 4 and cardinality 4/sup m/, and /spl alpha/_={/spl alpha//sub 0/,/spl alpha//sub 1/,...,/spl alpha//sub m-1/} be a basis of GR(4/sup m/) over /spl Zopf//sub 4/ when we regard GR(4/sup m/) as a free /spl Zopf//sub 4/-module of rank m. Define the map d/sub /spl alpha/_/ from GR(4/sup m/)[z]/(z/sup n/-1) into /spl Zopf//sub 4/[z]/(z/sup mn/-1) by d/spl alpha/_(a(z))=/spl Sigma//sub i=0//sup m-1//spl Sigma//sub j=0//sup n-1/a/sub ij/z/sup mj+i/ where a(z)=/spl Sigma//sub j=0//sup n-1/a/sub j/z/sup j/ and a/sub j/=/spl Sigma//sub i=0//sup m-1/a/sub ij//spl alpha//sub i/, a/sub ij//spl isin//spl Zopf//sub 4/. Then, for any linear code C of length n over GR(4/sup m/), its image d/sub /spl alpha/_/(C) is a /spl Zopf//sub 4/-linear code of length mn. In this article, for n and m being odd integers, it is determined all pairs (/spl alpha/_,C) such that d/sub /spl alpha/_/(C) is /spl Zopf//sub 4/-cyclic, where /spl alpha/_ is a basis of GR(4/sup m/) over /spl Zopf//sub 4/, and C is a cyclic code of length n over GR(4/sup m/). 相似文献
15.
T Kiran. Rajan B.S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(9):2242-2253
We study n-length Abelian codes over Galois rings with characteristic p/sup a/, where n and p are relatively prime, having the additional structure of being closed under the following two permutations: (i) permutation effected by multiplying the coordinates with a unit in the appropriate mixed-radix representation of the coordinate positions and (ii) shifting the coordinates by t positions. A code is t-quasi-cyclic (t-QC) if t is an integer such that cyclic shift of a codeword by t positions gives another codeword. We call the Abelian codes closed under the first permutation as unit-invariant Abelian codes and those closed under the second as quasi-cyclic Abelian (QCA) codes. Using a generalized discrete Fourier transform (GDFT) defined over an appropriate extension of the Galois ring, we show that unit-invariant Abelian and QCA codes can be easily characterized in the transform domain. For t=1, QCA codes coincide with those that are cyclic as well as Abelian. The number of such codes for a specified size and length is obtained and we also show that the dual of an unit-invariant t-QCA code is also an unit-invariant t-QCA code. Unit-invariant Abelian (hence unit-invariant cyclic) and t-QCA codes over Galois field F/sub p//sup l/ and over the integer residue rings are obtainable as special cases. 相似文献
16.
Chien-Yu Chen Duursma I.M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(5):1351-1353
We determine the actual parameters for a class of one-point codes of length 64 and 65 over F/sub 8/ defined by Hansen and Stichtenoth (1990). Several codes have a minimum distance that exceeds the Feng-Rao bound. The codes with parameters [64,5,51], [64,10,42], [64,11,42], [64,12,40], [65,5,52], [65,10,43], [65,11,42], [65,12,41], and [65,13,40] are better than any known code. 相似文献
17.
A new methodology is described for construction of block coded modulation (BCM) over modulo-8 rings for fading channels. Code construction criteria are defined to obtain the maximum use of channel characteristics and to achieve the phase invariance property. Some code examples are presented.<> 相似文献
18.
A two-stage list decoder for generalized Reed-Solomon codes over GR (p/sup l/,m) that can exceed the Guruswami-Sudan decoding radius t/sub GS/ with significant probability for p=2, l/spl ges/2 and m=1 was recently proposed. It makes a distinction between error values which are units and those which are zero divisors in order to exceed t/sub GS/. This letter presents an extension of that approach by exploiting the fact that each element of GR (p/sup l/,m) has a unique p-adic expansion, culminating in a multistage decoder that outperforms the two-stage decoder. 相似文献
19.
Knapp H. Wurzer M. Perndl W. Aufinger K. Bock J. Meister T.F. 《Solid-State Circuits, IEEE Journal of》2005,40(10):2118-2125
This paper presents two monolithic pseudorandom bit sequence (PRBS) generators. One circuit uses a seven-stage shift register operating with a half-rate clock and provides output signals up to 100 Gb/s. The second circuit contains an eleven-stage shift register operating with a full-rate clock up to 54 Gb/s. Both PRBS generators provide a wide range of data rates down to below 1 Gb/s simply by changing the frequency of the external clock signal without the need of any further adjustments. The integrated circuits provide a trigger output which can be switched between eye and pattern display. Furthermore, they contain additional circuitry to guarantee automatic start after power-on. The circuits are manufactured in a 200-GHz f/sub T/ SiGe bipolar technology. They each have a chip size of 900/spl times/700 /spl mu/m/sup 2/ and consume 1.5 and 1.9 W, respectively. 相似文献
20.
In this paper, we study the Gray images of the Chinese product of constacyclic and cyclic codes over a finite ring. We first introduce the Chinese product of constacyclic and cyclic codes over the finite ring. We then define a Gray map between codes over the finite ring and a finite field. We prove that the Gray image of the Chinese product of constacyclic codes over the finite ring is a distance-invariant quasi-cyclic code over the finite field. We also prove that each code over the finite field, which is the Gray image of the Chinese product of cyclic codes over the finite ring, is permutation equivalent to a quasi-cyclic code. 相似文献