共查询到15条相似文献,搜索用时 281 毫秒
1.
首先给出了环R=Fp+vFp+v2Fp上线性码及其对偶码的结构及其Gray象的性质.定义了环R上线性码的各种重量计数器并讨论了它们之间的关系,特别的,确定了该环上线性码与其对偶码之间关于完全重量计数器的MacWilliams恒等式,利用该恒等式,进一步建立了该环上线性码与其对偶码之间的一种对称形式的MacWilliams恒等式.最后,利用该对称形式的MacWilliams恒等式得到了该环上的Hamming重量计数器和Lee重量计数器的MacWilliams恒等式,利用不同的方法推广了文献[7]中的结果. 相似文献
2.
3.
Zk线性码的对称形式的MacWilliams恒等式 总被引:4,自引:0,他引:4
该文定义了Zk线性码的码字的对称重量计数公式,利用离散的Hadamard变换,建立了线性码与其对偶码之间的对称形式的MacWilliams恒等式。 相似文献
4.
最近,对由Rosenbloom 和Tsfasman提出的码字的一个非Hamming距离(简称为RT距离,或ρ距离)的研究引起了编码与密码学者的极大关注.本文定义并研究了Z4-码的Lee完全ρ重量计数器和精确完全ρ重量计数器,给出了Z4-线性码关于这两种ρ重量计数器相应的MacWilliams恒等式.利用该恒等式不必求出Z4-线性码C的对偶码C⊥,即可得到C⊥的Lee完全ρ重量计数器和精确完全ρ重量计数器. 相似文献
5.
Zk线性码的对称形式的MacWilliams恒等式 总被引:8,自引:2,他引:6
该文定义了Zk线性码的码字的对称重量计数公式,利用离散的Hadamard变换,建立了线性码与其对偶码之间的对称形式的MacWilliams恒等式. 相似文献
6.
研究了环F4+uF4与域F4上的线性码,利用环F4+uF4上码C的Gray重量wG,Gray距离d G和(F4+uF4)n到F4 2n的Gray映射φ,证明了环F4+uF4上线性码C及其对偶码的Gray像φ(C)为F4上的线性码和对偶且dH G(φ(C))dG(C)。同时,给出了F4+uF4上循环码C的Gray像φ(C)为F4上的2-拟循环码。 相似文献
7.
8.
9.
10.
有限环Z4上码字广度的性质及其递归算法 总被引:1,自引:0,他引:1
研究码及码字的结构是编码理论的一个重要研究方向.该文定义了环Z4上码字的一种数学特征,即码字的广度.研究了码字广度的一些性质,给出了计算Z4环上码字广度的两种递归算法,并对Z4环上的码字广度与深度之间的关系进行了初步的讨论. 相似文献
11.
12.
This paper is devoted to the construction of one and two-weight Z2R2 additive codes, where R2 =F2[v]/. It is a generalization towards another direction of Z2Z4 codes (S.T. Dougherty, H.W. Liu and L. Yu,"One weight Z2Z4 additive codes", Applicable Algebra in Engineering, Communication and Computing, Vol.27, No.2, pp.123–138, 2016). A MacWilliams identity which connects the weight enumerator of an additive code over Z2 R2 and its dual is established. Several construction methods of one-weight and two-weight additive codes over Z2 R2 are presented. Several examples are presented to illustrate our main results and some open problems are also proposed. 相似文献
13.
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 相似文献
14.
15.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1981,27(2):256-257
A reformulation of MacWilliams type of relation between the split-weight enumerators of a pair of dual codes is shown to exhibit an identity on the row weight and column weight distributions of a matrix. 相似文献