We study the structure of cyclic codes of length 2k?over Z8?for any natural number k.? It is known that cyclic codes of length 2k?over Z8?are ideals of the ring R=Z8[X]/. In this paper we prove that the ring R=Z8[X]/ ...We study the structure of cyclic codes of length 2k?over Z8?for any natural number k.? It is known that cyclic codes of length 2k?over Z8?are ideals of the ring R=Z8[X]/. In this paper we prove that the ring R=Z8[X]/ is a local ring with unique maximal ideal, thereby implying that R is not a principal ideal ring.? We also prove that cyclic codes of length?2k?over Z8?are generated as ideals by at most three elements.展开更多
The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, ...The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.展开更多
Let t ≥ 2 be an integer, and let p1, ···, ptbe distinct primes. By using algebraic properties, the present paper gives a sufficient and necessary condition for the existence of non-trivial self-orthogo...Let t ≥ 2 be an integer, and let p1, ···, ptbe distinct primes. By using algebraic properties, the present paper gives a sufficient and necessary condition for the existence of non-trivial self-orthogonal cyclic codes over the ring Zp1p2···ptand the corresponding explicit enumerating formula. And it proves that there does not exist any self-dual cyclic code over Zp1p2···pt.展开更多
文摘We study the structure of cyclic codes of length 2k?over Z8?for any natural number k.? It is known that cyclic codes of length 2k?over Z8?are ideals of the ring R=Z8[X]/. In this paper we prove that the ring R=Z8[X]/ is a local ring with unique maximal ideal, thereby implying that R is not a principal ideal ring.? We also prove that cyclic codes of length?2k?over Z8?are generated as ideals by at most three elements.
文摘The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.
基金Supported by Doctoral Fund in Institutions of Higher Learning (20080359003)Key Project of Educational Office of Anhui Province on Natural Sciences (KJ2008A140)Natural Sciences Project of Hefei University (08KY036ZR)
基金supported by the Project of Science and Technology Department of Sichuan Province(No.2016JY0134)
文摘Let t ≥ 2 be an integer, and let p1, ···, ptbe distinct primes. By using algebraic properties, the present paper gives a sufficient and necessary condition for the existence of non-trivial self-orthogonal cyclic codes over the ring Zp1p2···ptand the corresponding explicit enumerating formula. And it proves that there does not exist any self-dual cyclic code over Zp1p2···pt.
