Rank weight hierarchy of some classes of cyclic codes

preprint2014arXivOpen access

Abstract

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field Fqm\mathbb F_{q^m}, qq a prime power, m≥2m \geq 2. We establish the rank weight hierarchy for [n,n−1][n,n-1] cyclic codes and characterize [n,k][n,k] cyclic codes of rank metric 1 when (1) k=1k=1, (2) nn and qq are coprime, and (3) the characteristic char(Fq)char(\mathbb F_q) divides nn. Finally, for nn and qq coprime, cyclic codes of minimal rr-rank are characterized, and a refinement of the Singleton bound for the rank weight is derived.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.