The ranks of cyclic and negacyclic codes over the finite chain ring R as well as their minimal generating sets are defined, and then the expression forms we presented by studying the structures of cyclic and negacycli...The ranks of cyclic and negacyclic codes over the finite chain ring R as well as their minimal generating sets are defined, and then the expression forms we presented by studying the structures of cyclic and negacyclic codes over the finite chain ring R. Through the paper, it is assumed that the length of codes n can not be divided by the characteristic of R.展开更多
The study of cyclic codes over rings has generated a lot of public interest.In this paper,we study cyclic codes and their dual codes over the ring Z P2 of length pe,and find a set of generators for these codes.The ran...The study of cyclic codes over rings has generated a lot of public interest.In this paper,we study cyclic codes and their dual codes over the ring Z P2 of length pe,and find a set of generators for these codes.The ranks and minimal generator sets of these codes are studied as well,which play an important role in decoding and determining the distance distribution of codes.展开更多
A new notion of bent sequence related to Hadamard matrices was introduced recently,motivated by a security application(Solé,et al.,2021).The authors study the self-dual class in length at most 196.The authors use...A new notion of bent sequence related to Hadamard matrices was introduced recently,motivated by a security application(Solé,et al.,2021).The authors study the self-dual class in length at most 196.The authors use three competing methods of generation:Exhaustion,Linear Algebra and Gr?bner bases.Regular Hadamard matrices and Bush-type Hadamard matrices provide many examples.The authors conjecture that if v is an even perfect square,a self-dual bent sequence of length v always exists.The authors introduce the strong automorphism group of Hadamard matrices,which acts on their associated self-dual bent sequences.The authors give an efficient algorithm to compute that group.展开更多
The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred...The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred they cannot be cyclic,except for the exceptions of the SRGs of parameters(85,42,20,21)and(96,60,38,36).In particular,the adjacency code of a(85,42,20,21)is the zero-sum code.In the range[100,200]the authors find 29 SRGs that could possibly have a cyclic adjacency code.展开更多
This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4.The authors first give the Pless identities on the Lee weight of linear codes over Z_4.Then the...This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4.The authors first give the Pless identities on the Lee weight of linear codes over Z_4.Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively,the construction methods of one-Lee weight and two-Lee weight projective codes over Z4 are also given.Finally,the authors recall the weight-preserving Gray map from(Z_4~n,Lee weight)to(F_2^(2n),Hamming weight),and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes,which reach the Plotkin bound and the Griesmer bound.展开更多
This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preservi...This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.展开更多
This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~...This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~n, Lee weight) to(IF_p^(2 n), Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p=2.展开更多
This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over Z_4 +uZ_4(u^2=u) with type 16^(k_1)8^...This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over Z_4 +uZ_4(u^2=u) with type 16^(k_1)8^(k_2)8^(k_3)4^(k_4)4^(k_5)4^(k_6)2^(k_7)2^(k_8) based on a distance-preserving Gray map from(Z4 + u Z4)n to Z2n4. Secondly, the authors use the similar approach to do works on two-Gray(projective) weight linear codes. Finally, some examples are given to illustrate the construction methods.展开更多
基金Partly supported by the National Natural Science Foundations of China (No.60673074)key project of Ministry of Education Science and Technology’s Research (107065).
文摘The ranks of cyclic and negacyclic codes over the finite chain ring R as well as their minimal generating sets are defined, and then the expression forms we presented by studying the structures of cyclic and negacyclic codes over the finite chain ring R. Through the paper, it is assumed that the length of codes n can not be divided by the characteristic of R.
基金the National Natural Science Foundation of China(No.60673074)the Key Project of Ministry of Education Science and Technology’s Research(107065)
文摘The study of cyclic codes over rings has generated a lot of public interest.In this paper,we study cyclic codes and their dual codes over the ring Z P2 of length pe,and find a set of generators for these codes.The ranks and minimal generator sets of these codes are studied as well,which play an important role in decoding and determining the distance distribution of codes.
基金Supported by National Natural Science Foundation of China(61672036)Excellent Youth Foundation of Natural Science Foundation of Anhui Province(1808085J20)
基金Supported by National Natural Science Foundation of China(61672036)Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China(05015133)+1 种基金the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University(2015D11)Key Projects of Support Program for Outstanding Young Talents in Colleges and Universities(gxyqZD2016008)
基金supported in part by the National Natural Science Foundation of China under Grant No.12071001The work of Dean Crnkovi?is supported by Croatian Science Foundation under the project 6732。
文摘A new notion of bent sequence related to Hadamard matrices was introduced recently,motivated by a security application(Solé,et al.,2021).The authors study the self-dual class in length at most 196.The authors use three competing methods of generation:Exhaustion,Linear Algebra and Gr?bner bases.Regular Hadamard matrices and Bush-type Hadamard matrices provide many examples.The authors conjecture that if v is an even perfect square,a self-dual bent sequence of length v always exists.The authors introduce the strong automorphism group of Hadamard matrices,which acts on their associated self-dual bent sequences.The authors give an efficient algorithm to compute that group.
基金supported by the National Natural Science Foundation of China under Grant Nos. 120710012021 University Graduate Research Project under Grant Nos. Y020410077+1 种基金the National Natural Science Foundation of China under Grant No. 12201170the Natural Science Foundation of Anhui Province under Grant No. 2108085QA03
文摘The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred they cannot be cyclic,except for the exceptions of the SRGs of parameters(85,42,20,21)and(96,60,38,36).In particular,the adjacency code of a(85,42,20,21)is the zero-sum code.In the range[100,200]the authors find 29 SRGs that could possibly have a cyclic adjacency code.
基金supported by the National Natural Science Foundation of China under Grant Nos.61202068 and 11126174Talents youth Fund of Anhui Province Universities under Grant No.2012SQRL020ZDsupported by Key Discipline Construction of Hefei University 2014XK08
文摘This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over Z4.The authors first give the Pless identities on the Lee weight of linear codes over Z_4.Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively,the construction methods of one-Lee weight and two-Lee weight projective codes over Z4 are also given.Finally,the authors recall the weight-preserving Gray map from(Z_4~n,Lee weight)to(F_2^(2n),Hamming weight),and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes,which reach the Plotkin bound and the Griesmer bound.
基金supported by the National Natural Science Foundation of China under Grant No.61202068Talented youth Fund of Anhui Province Universities under Grant No.2012SQRL020ZDthe Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China under Grant No.05015133
文摘This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.
基金supported by the National Natural Science Foundation of China under Grant No.61202068Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China under Grant No.05015133+1 种基金the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University under Grant No.2015D11Key Projects of Support Program for Outstanding Young Talents in Colleges and Universities under Grant No.gxyqZD2016008
文摘This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~n, Lee weight) to(IF_p^(2 n), Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p=2.
基金supported by the National Natural Science Foundation of China under Grant Nos.61672036 and 61202068the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University under Grant No.2015D11+1 种基金Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China under Grant No.05015133Key projects of support program for outstanding young talents in Colleges and Universities under Grant No.gxyq ZD2016008
文摘This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over Z_4 +uZ_4(u^2=u) with type 16^(k_1)8^(k_2)8^(k_3)4^(k_4)4^(k_5)4^(k_6)2^(k_7)2^(k_8) based on a distance-preserving Gray map from(Z4 + u Z4)n to Z2n4. Secondly, the authors use the similar approach to do works on two-Gray(projective) weight linear codes. Finally, some examples are given to illustrate the construction methods.
