共查询到20条相似文献,搜索用时 15 毫秒
1.
Gulliver T.A. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2000,46(1):271-274
Optimal double circulant self-dual codes over F4 have been found for each length n⩽40. For lengths n⩽14, 20, 22, 24, 28, and 30, these codes are optimal self-dual codes. For length 26, the code attains the highest known minimum weight. For n⩾32, the codes presented provide the highest known minimum weights. The [36,18,12] self-dual code improves the lower bound on the highest minimum weight for a [36,18] linear code 相似文献
2.
Betsumiya K. Gulliver T.A. Harada M. Munemasa A. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2001,47(6):2242-2248
Previously, Type II codes over F4 have been introduced as Euclidean self-dual codes with the property that all Lee weights are divisible by four. In this paper, a number of properties of Type II codes are presented. We construct several extremal Type II codes and a number of extremal Type I codes. It is also shown that there are seven Type II codes of length 12, up to permutation equivalence 相似文献
3.
Calderbank A.R. McGuire G. Kumar V.P. Helleseth T. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1996,42(1):217-226
Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock (1972) and Preparata (1968) codes that can be very simply constructed as binary images, under the Gray map, of linear codes over Z4 that are defined by means of parity checks involving Galois rings. This paper describes how Fourier transforms on Galois rings and elementary symmetric functions can be used to derive lower bounds on the minimum distance of such codes. These methods and techniques from algebraic geometry are applied to find the exact minimum distance of a family of Z 4. Linear codes with length 2m (m, odd) and size 2(2m+1-5m-2). The Gray image of the code of length 32 is the best (64, 237) code that is presently known. This paper also determines the exact minimum Lee distance of the linear codes over Z4 that are obtained from the extended binary two- and three-error-correcting BCH codes by Hensel lifting. The Gray image of the Hensel lift of the three-error-correcting BCH code of length 32 is the best (64, 232) code that is presently known. This code also determines an extremal 32-dimensional even unimodular lattice 相似文献
4.
5.
Bonnecaze A. Duursma I.M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1997,43(4):1218-1230
We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complete coset weight enumerators for the Preparata codes are both equal to ten, independent of the code length 相似文献
6.
Aydin N. Ray-Chaudhuri D.K. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(7):2065-2069
Previously, (linear) codes over Z 4 and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study Z 4-QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to Z 4 produces a new binary code, a (92, 224, 28)-code, which is the best among all binary codes (linear or nonlinear). Moreover, we characterize cyclic codes corresponding to free modules in terms of their generator polynomials 相似文献
7.
Wolfmann J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2001,47(5):1773-1779
We determine all linear cyclic codes over Z 4 of odd length whose Gray images are linear codes (or, equivalently, whose Nechaev-Gray (1989) image are linear cyclic codes or are linear cyclic codes) 相似文献
8.
Dougherty S.T. Shiromoto K. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2000,46(1):265-269
In this correspondence, we study maximum distance with respect to rank (MDR) codes over the ring Zk. We generalize the construction of Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon codes and apply the generalized Chinese remainder theorem to construct codes 相似文献
9.
10.
11.
Kyeongcheol Yang Helleseth T. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1997,43(6):1832-1842
Hammons et al. (see ibid., vol.40, p.301-19, 1994) showed that, when properly defined, the binary nonlinear Preparata code can be considered as the Gray map of a linear code over Z4, the so called Preparata code over Z4. We consider the rth generalized Hamming weight dr(m) of the Preparata code of length 2m over Z4. For any m⩾3, dr(m) is exactly determined for r=0.5, 1, 1.5, 2, 2.5 and 3.0. For a composite m, we give an upper bound on dr(m) using the lifting technique. For m=3, 4, 5, 6 and 8, the weight hierarchy is completely determined. In the case of m=7, the weight hierarchy is completely determined except for d4(7) 相似文献
12.
Betsumiya K. Harada M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(2):356-358
In this paper, we study optimal self-dual codes and type IV self-dual codes over the ring F/sub 2//spl times/F/sub 2/ of order 4. We give improved upper bounds on minimum Hamming and Lee weights for such codes. Using the bounds, we determine the highest minimum Hamming and Lee weights for such codes of lengths up to 30. We also construct optimal self-dual codes and type IV self-dual codes. 相似文献
13.
用XeF激光的351毫米微来激励Na_2(x~1Σ_g~ )得到c~1Π_u→2~1Σ_g~ 跃迁范围内三条受激发射谱线及b~3Σ_g~ →x~3Σ_u~ 830毫微米至900毫微米准连续发射谱。文中讨论了这两个跃迁的关联并估计了产生激光振荡的可能性。 相似文献
14.
Circulant based extremal additive self-dual codes over GF(4) 总被引:2,自引:0,他引:2
Gulliver T.A. Kim J.-L. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(2):359-366
It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27. 相似文献
15.
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. 相似文献
16.
17.
18.
Carlet C. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1998,44(4):1543-1547
We introduce a generalization to Z2k of the Gray map and generalized versions of Kerdock and Delsarte-Goethals codes 相似文献
19.
介绍了一种高效F3/E类功率放大器的设计方法,该放大器将F类功率放大器的谐波控制电路引入逆E类功率放大器的负载网络,以改善放大器性能。此电路结构提升了放大器的功率输出能力,降低了电路对功率放大器管器件漏极耐压特性的要求,增强了器件工作时的安全性。详细阐述了该放大器的设计过程,并给出了负载网络各器件的最佳设计取值方程。选用GaNHEMT器件研制了S频段F3/E类功率放大器测试电路。实测结果表明该放大器在驱动功率为27 dBm时,可获得40.3 dBm的输出功率,具有13.3 dB增益,工作效率高达78.1%,功率附加效率为75.2%。实测结果与仿真结果吻合,验证了设计方法的正确性。 相似文献
20.
It is shown that there exists a class of error correcting codes which can be viewed both as binary cyclic codes and as multilevel cyclic codes. This class contains not only the Burton codes but also some Reed Solomon codes. The conditions which codes of this class must satisfy are explained and some simple examples are given 相似文献