The Minimum Hamming Distance of Cyclic Codes of Length 2ps

Authors:
Hakan Özadam;Ferruh Özbudak
Affiliations:
Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey 06531;Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey 06531
Venue:
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2009

Citing 4
Cited 0

Finite fields

Finite fields
Repeated-root cyclic and negacyclic codes over a finite chain ring

Discrete Applied Mathematics - Special issue: Coding and cryptography
On generalizations of repeated-root cyclic codes

IEEE Transactions on Information Theory
On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study cyclic codes of length 2p s over $\mathbb {F}_{q}$, where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.