A NOTE ON NEGACYCLIC AND CYCLIC CODES OF LENGTH p(s) OVER A FINITE FIELD OF CHARACTERISTIC p

Download

10.3934:amc.2009.3.265.pdf

Date

2009-08-01

Author

ÖZADAM, Hakan
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

9
views

12
downloads

Recently, the minimum Hamming weights of negacyclic and cyclic codes of length p(s) over a finite field of characteristic p are determined in [4]. We show that the minimum Hamming weights of such codes can also be obtained immediately using the results of [1].

Subject Keywords

Computer Networks and Communications, Algebra and Number Theory, Applied Mathematics, Discrete Mathematics and Combinatorics, Cyclic code, Negacyclic code, Repeated-root cyclic code

URI

https://hdl.handle.net/11511/46580

Journal

ADVANCES IN MATHEMATICS OF COMMUNICATIONS

DOI

https://doi.org/10.3934/amc.2009.3.265

Collections

Department of Mathematics, Article

Citation Formats

H. ÖZADAM and F. Özbudak, “A NOTE ON NEGACYCLIC AND CYCLIC CODES OF LENGTH p(s) OVER A FINITE FIELD OF CHARACTERISTIC p,” ADVANCES IN MATHEMATICS OF COMMUNICATIONS, vol. 3, no. 3, pp. 265–271, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46580.