Cyclically permutable codes specified by roots of generator polynomial

@inproceedings{LemosNeto2014CyclicallyPC,
  title={Cyclically permutable codes specified by roots of generator polynomial},
  author={Jos{\'e} S. Lemos-Neto and Vieira da Rocha},
  year={2014}
}
A condition is proven on the roots of the generator polynomial of a q-ary cyclic code of block length n which guarantees full cyclic order for all nonzero codewords. For such cyclic codes having n = qm − 1, a theorem is proven which allows to partition the set of all nonzero codewords into cyclic equivalence classes of order n. 

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

's all folks! Thank you!

  • 's all folks! Thank you!

Cyclically Permutable Codes Specified by Roots of the Generator Polynomia

J S Lemos-Neto, V C Da Rocha, Jr
  • Cyclically Permutable Codes Specified by Roots of the Generator Polynomia