Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)

Authors:

Open Access

Publisher website

12 October 2021

journal article
research article
Published by MDPI AG in Mathematics

Vol. 9 (20) , 2554
DOI:10.3390/math9202554

Abstract

Let p be a prime, s, m be positive integers,

γ

be a nonzero element of the finite field

F_{p^{m}}

, and let

R = F_{p^{m}} [u] / ⟨ u^{3} ⟩

be the finite commutative chain ring. In this paper, the symbol-pair distances of all

γ

-constacyclic codes of length

p^{s}

over

R

are completely determined.

Keywords

This publication has 27 references indexed in Scilit:

Constacyclic codes of length $p^{s}$ over $F_{p^{m}} + u F_{p^{m}}$
Journal of Algebra, 2010
Self-dual codes over commutative Frobenius rings
Finite Fields and Their Applications, 2010
Constacyclic codes over
Journal of the Franklin Institute, 2009
On (1−u) -cyclic codes over $F_{p^{k}} + u F_{p^{k}}$
Applied Mathematics Letters, 2008
On the decomposition of self-dual codes over $F_{2} + u F_{2}$ with an automorphism of odd prime order
Finite Fields and Their Applications, 2007
$(1 + u)$ constacyclic and cyclic codes over $F_{2} + u F_{2}$
Applied Mathematics Letters, 2006
New linear codes over F/sub 5/ obtained by tripling method and improvements on bounds
IEEE Transactions on Information Theory, 2002
Type II codes over F/sub 2/+uF/sub 2/
IEEE Transactions on Information Theory, 1999
On repeated-root cyclic codes
IEEE Transactions on Information Theory, 1991
Repeated-root cyclic codes
IEEE Transactions on Information Theory, 1991