Unique Generators for Cyclic Codes of Arbitrary Length over Fpmu/u3 and Their Applications

Hongju Li, Ping Yu, Jing Liang, Feng Zhao and Jie Wu

Journal of Mathematics, 2022, vol. 2022, 1-11

Abstract: Cyclic codes play a very important role in the history of coding theory since they have good algebraic structures that can be widely used in coding and decoding. However, generators for repeated-root cyclic codes of arbitrary length over Fpmu/uk are not unique in previous works for k≥3, and hence it is impossible to determine their dual codes. In this work, we propose unique generators for cyclic codes of arbitrary length over Fpmu/u3. As its applications, we derive the numbers of their codewords, as well as generators for their dual codes. Furthermore, we propose necessary and sufficient conditions for their self-dualities.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/6108863.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/6108863.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:6108863

DOI: 10.1155/2022/6108863

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().