A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$

Hakan Özadam; Ferruh Özbudak

doi:10.3934/amc.2009.3.265

Article Contents

2009, Volume 3, Issue 3: 265-271. Doi: 10.3934/amc.2009.3.265

This issue Previous Article Construction of new self-dual codes over $GF(5)$ using skew-Hadamard matrices Next Article Bounds and constructions for key distribution schemes

A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$

Hakan Özadam^1, and
Ferruh Özbudak^1,

1.
Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, Ínönü Bulvarı, 06531, Ankara

Received: March 2009

Revised: June 2009

Published: August 2009

Abstract / Introduction Related Papers Cited by

Abstract

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].

Keywords:

Mathematics Subject Classification: Primary: 11T71, 94B15; Secondary: 94B05.

Citation:

Article Metrics

HTML views() PDF downloads(140) Cited by(0)

A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content