Open AccessA note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$
Author(s) -
Hakan Özadam,
Ferruh Özbudak
Publication year - 2009
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2009.3.265
Subject(s) - mathematics , finite field , hamming code , cyclic code , combinatorics , hamming distance , field (mathematics) , discrete mathematics , linear code , pure mathematics , algorithm , block code , decoding methods
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].
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom