共查询到15条相似文献,搜索用时 125 毫秒
1.
2.
3.
4.
纠错码是提高信息传输效率与可靠性的重要手段.构造性能良好的线性码类是纠错码研究中的一个基本问题.本文主要讨论了有限非链环Fq[v]/(vm-v)上自对偶常循环码的代数结构,包括Euclidean自对偶常循环码、Hermitian自对偶常循环码以及Hermitian自对偶常循环码的极大距离可分(MDS)码.本文给出了环Fq[v]/(vm-v)上常循环码是Euclidean自对偶码的充分条件,以及是Hermitian自对偶码的充要条件,并利用Gray映射构造了有限域Fq上一些参数较好的自对偶码.特别地,本文得到了有限域F192上一个新的参数为[16,8,6]的Hermitian自对偶码. 相似文献
5.
纠缠辅助量子纠错码是经典量子纠错码的推广,通过在接收者和发送者双方预先共享纠缠态的方式实现量子通信.由于预先共享纠缠态会造成额外的费用,如何构造具有较小预先共享纠缠态的纠缠辅助量子纠错码是一个有趣的问题.本文给出了有限域Fq2上一类负循环码是厄米特对偶包含码的充分条件,通过研究其分圆陪集的结构性质,确定了不同数目的预先共享纠缠态的存在条件,并结合纠缠辅助量子纠错码的构造方法,构造了一些新的具有较小预先共享纠缠态的纠缠辅助量子Maximum-Distance-Separable(MDS)码. 相似文献
6.
7.
最近,剩余类环上的常循环码及常循环自对偶码引起了编码学者的极大关注.本文首先利用一些相关的线性码,建立了一类特殊有限链环上长为N的常循环自对偶码的一般理论,利用其结果给出了该环上长为N的(1+uλ)-常循环自对偶码存在的充分条件,得到了该环上长为N的一些常循环自对偶码,并给出了其生成多项式. 相似文献
8.
9.
研究码字的距离分布是编码理论的一个重要研究方向。该文定义了环R=F2+uF2++uk-1F2上的Homogeneous重量,研究了环R上长为2s的(1+u)-常循环码的Hamming距离和Homogeneous距离。使用了有限环和域的理论,给出了环R上长为2s的(1+u)-常循环码和循环自对偶码的结构和码字个数。并利用该常循环码的结构,确定了环R上长为2s的(1+u)-常循环码的Hamming距离和Homogeneous距离分布。 相似文献
10.
11.
Quantum cyclic and constacyclic codes 总被引:1,自引:0,他引:1
Lin Xiaoyan 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(3):547-549
Based on classical quaternary constacyclic linear codes, we construct a set of quantum codes with parameters [[(4/sup m/ -1)/3, (4/sup m/ -1)/3 -2(3l + b)m, 4l + b + 2]] where m/spl ges/4, 1/spl les/b/spl les/3, and 12l + 3b < 2 /spl times/ 4/sup /spl lfloor/(m+2)/3/spl rfloor//-1, which are better than the codes in Bierbrauer and Edel (2000). 相似文献
12.
Consta-Abelian polyadic codes 总被引:1,自引:0,他引:1
Chong Jie Lim 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(6):2198-2206
In this correspondence, the class of polyadic codes is generalized to the class of consta-Abelian polyadic codes, which, in particular, includes the class of constacyclic polyadic codes. Properties such as the equivalence of polyadic codes and the mth-root lower bound for the minimum weight of a subcode of certain types of polyadic codes are preserved in the consta-Abelian case. Sufficient conditions for the existence of this class of codes are established. For the special case of constacyclic codes, the characterization of negacyclic self-dual codes of length coprime to the characteristic of the field in terms of negacyclic duadic codes is also given 相似文献
13.
By constructing a Gray map, constacyclic codes of arbitrary lengths over ring R = Zpm + vZpm are studied, where v2 = 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)αp)-constacyclic codes over R are classified in terms of generator polynomial, where α is a unit of Zpm. 相似文献
14.
Salah A. Aly Andreas Klappenecker Pradeep Kiran Sarvepalli 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(3):1183-1188
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its dual code only if its designed distance delta=O(radicn), and the converse is proved in the case of narrow-sense codes. Furthermore, the dimension of narrow-sense BCH codes with small design distance is completely determined, and - consequently - the bounds on their minimum distance are improved. These results make it possible to determine the parameters of quantum BCH codes in terms of their design parameters 相似文献