共查询到20条相似文献,搜索用时 15 毫秒
1.
Quaternary 1-generator quasi-cyclic codes are considered in the paper. Under the conditions that n is odd and gcd(|2|
n
, m) = 1, where |2|
n
denotes the order of 2 modulo n, we give the enumeration of quaternary 1-generator quasi-cyclic codes of length mn, and describe an algorithm which will obtain one, and only one, generator for each quaternary 1-generator quasi-cyclic code. 相似文献
2.
Yonglin Cao 《Designs, Codes and Cryptography》2011,60(1):67-79
Let F q be a finite field of cardinality q, m 1, m 2, . . . , m l be any positive integers, and \({A_i=F_q[x]/(x^{m_i}-1)}\) for i = 1, . . . , l. A generalized quasi-cyclic (GQC) code of block length type (m 1, m 2, . . . , m l ) over F q is defined as an F q [x]-submodule of the F q [x]-module \({A_1\times A_2\times\cdots\times A_l}\). By the Chinese Remainder Theorem for F q [x] and enumeration results of submodules of modules over finite commutative chain rings, we investigate structural properties of GQC codes and enumeration of all 1-generator GQC codes and 1-generator GQC codes with a fixed parity-check polynomial respectively. Furthermore, we give an algorithm to count numbers of 1-generator GQC codes. 相似文献
3.
Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/(x^m - 1). In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct sum of a fixed number of cyclic irreducible A-submodules. Finally the distinct quasi-cyclic codes as well as some specific subclasses are enumerated. 相似文献
4.
Anne Desideri Bracco 《Discrete Applied Mathematics》2008,156(18):3362-3375
5.
6.
Quasi-cyclic codes have provided a rich source of good linear codes. Previous constructions of quasi-cyclic codes have been confined mainly to codes whose length is a multiple of the dimension. In this paper it is shown how searches may be extended to codes whose length is a multiple of some integer which is greater than the dimension. The particular case of 5-dimensional codes over GF(3) is considered and a number of optimal codes (i.e., [n, k, d]-codes having largest possible minimum distance d for given length n and dimension k) are constructed. These include ternary codes with parameters [45, 5, 28], [36, 5, 22], [42, 5, 26], [48, 5, 30] and [72, 5, 46], all of which improve on the previously best known bounds.This research has been supported by the British SERC. 相似文献
7.
We consider a q-ary quasi-cyclic code C of length m? and index ?, where both m and ? are relatively prime to q. If the constituents of C are cyclic codes, we show that C can also be viewed as a 2-D cyclic code of size over . In case m and ? are also coprime to each other, we easily observe that the code C must be equivalent to a cyclic code, which was proved earlier by Lim. 相似文献
8.
9.
Sunghyu Han Jon-Lark Kim Heisook Lee Yoonjin Lee 《Finite Fields and Their Applications》2012,18(3):613-633
There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field and linear codes over a ring . Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field can be obtained by the building-up construction, provided that or , m is a prime p, and q is a primitive element of . We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When , we obtain a new 8-quasi-cyclic self-dual code over and a new 6-quasi-cyclic self-dual code over . When , we find a new 4-quasi-cyclic self-dual code over and a new 6-quasi-cyclic self-dual code over . 相似文献
10.
11.
12.
Maheshanand Bhaintwal 《Designs, Codes and Cryptography》2012,62(1):85-101
Recently there has been a lot of interest on algebraic codes in the setting of skew polynomial rings. In this paper we have
studied skew quasi-cyclic (QC) codes over Galois rings. We have given a necessary and sufficient condition for skew cyclic
codes over Galois rings to be free, and determined a distance bound for free skew cyclic codes. A sufficient condition for
1-generator skew QC codes to be free is determined. Some distance bounds for free 1-generator skew QC codes are discussed.
A canonical decomposition of skew QC codes is presented. 相似文献
13.
Generalizing the quasi-cyclic codes of index introduced by Fan et al., we study a more general class of quasi-cyclic codes of fractional index generated by pairs of polynomials. The parity check polynomial and encoder of these codes are obtained. The asymptotic behaviours of the rates and relative distances of this class of codes are studied by using a probabilistic method. We prove that, for any positive real number such that the asymptotic GV-bound at is greater than , the relative distance of the code is convergent to , while the rate is convergent to . As a result, quasi-cyclic codes of fractional index are asymptotically good. 相似文献
14.
Let F q be a finite field of cardinality q, l and m be positive integers and M l (F q ) the F q -algebra of all l × l matrices over F q . We investigate the relationship between monic factors of X m ? 1 in the polynomial ring M l (F q )[X] and quasi-cyclic (QC) codes of length lm and index l over F q . Then we consider the idea of constructing QC codes from monic factors of X m ? 1 in polynomial rings over F q -subalgebras of M l (F q ). This idea includes ideas of constructing QC codes of length lm and index l over F q from cyclic codes of length m over a finite field F q l, the finite chain ring F q + uF q + · · · + u l ? 1 F q (u l = 0) and other type of finite chain rings. 相似文献
15.
16.
An index , length quasi-cyclic code can be viewed as a cyclic code of length over the field via a basis of the extension . However, this cyclic code is only linear over , making it an additive cyclic code, or an -linear cyclic code, over the alphabet . This approach was recently used in Shi et al. (2017) [16] to study a class of quasi-cyclic codes, and more importantly in Shi et al. (2017) [17] to settle a long-standing question on the asymptotic performance of cyclic codes. Here, we answer one of the problems posed in these two articles, and characterize those quasi-cyclic codes which have -linear cyclic images under a basis of the extension . Our characterizations are based on the module structure of quasi-cyclic codes, as well as on their CRT decompositions into constituents. In the case of a polynomial basis, we characterize the constituents by using the theory of invariant subspaces of operators. We also observe that analogous results extend to the case of quasi-twisted codes. 相似文献
17.
Designs, Codes and Cryptography - In this paper, we construct a family of non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes. Moreover, we present a... 相似文献
18.
19.
20.
Designs, Codes and Cryptography - A code is said to have locality r if any coordinate value in a codeword of that code can be recovered by at most r other coordinates. In this paper, we have... 相似文献