Cyclic codes over GF(q) with simple orbit structure
Let C be a cyclic [n,k] code over \(F=GF(q)\), with generator g(x) and parity check polynomial h(x). C is said to have simple orbit structure if any polynomial \(g_ 1(x)\) that generates the ideal C in \(F[x]/(x^ n- 1)\) must have the form \(g_ 1(x)=ax^ ig(x)\) with \(a\in F\). It is shown how to compute the weight distribution of C in this case. The main result is the characterization of the polynomials h(x) corresponding to codes with simple orbit structure. In the binary case h(x) is the product of primitive polynomials of relatively prime degrees, possibly multiplied by \((X+1)^ 2\) or \((X+1)^ 3\) if one allows even word length.
- Cyclic codes over \(R_{k,q}\)
- Cyclic Codes Over Gf(4) and Gf(2)
- Cyclic orbit codes and stabilizer subfields
- Cyclic codes over some finite quaternion integer rings
- scientific article; zbMATH DE number 7434616
- Cyclic codes over Galois rings
- scientific article; zbMATH DE number 1406438
- Cyclic self-orthogonal codes over finite chain ring
- Cyclic codes over \(R_{k}\)
- About quasi-cyclic codes over finite fields
- Equidistant cyclic codes over GF(q)
- Finite Rings Having a Cyclic Multiplicative Group of Units
- How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 3506560 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- On the evaluation of minimum distance of binary arithmetic cyclic codes
This page was built for publication: Cyclic codes over GF(q) with simple orbit structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821757)
