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

197
views

137
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

Suggestions

OpenMETU
Core

A Bound on the Minimum Distance of Quasi-cyclic Codes Gueneri, Cem; Özbudak, Ferruh (2012-01-01) We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and index l, where m is relatively prime to q. The bound involves the minimum distances of constituent codes of length l as well as the minimum distances of certain cyclic codes of length m which are related to the fields over which the constituents are defined. We present examples which show that the bound is sharp in many instances. We also compare the performance of our bound against the bounds of Lally and Es...
A relation between quasi-cyclic codes and 2-D cyclic codes Guneri, Cem; Özbudak, Ferruh (Elsevier BV, 2012-01-01) We consider a q-ary quasi-cyclic code C of length ml and index l, where both in and l are relatively prime to q. If the constituents of C are cyclic codes, we show that C can also be viewed as a 2-D cyclic code of size m x l over F(q). In case in and l are also coprime to each other, we easily observe that the code C must be equivalent to a cyclic code, which was proved earlier by Lim.
Gilbert Varshamov type bounds for linear codes over finite chain rings Özbudak, Ferruh (American Institute of Mathematical Sciences (AIMS), 2007-02-01) We obtain finite and asymptotic Gilbert-Varshamov type bounds for linear codes over finite chain rings with various weights.
Additive cyclic complementary dual codes over F4 Shi, Minjia; Liu, Na; Özbudak, Ferruh; Solé, Patrick (2022-10-01) © 2022 Elsevier Inc.An additive cyclic code of length n over F4 can be defined equivalently as an F2[x]/〈xn+1〉-submodule of F4[x]/〈xn+1〉. In this paper we study additive cyclic and complementary dual codes of odd length over F4 with respect to the trace Hermitian inner product and the trace Euclidean inner product. We characterize subfield subcodes and trace codes of these codes by their generators as binary cyclic codes.
The Minimum Hamming Distance of Cyclic Codes of Length 2ps ÖZADAM, Hakan; Özbudak, Ferruh (2009-06-12) We study cyclic codes of length 2p(s) over F-q where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.

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, pp. 265–271, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46580.