2011
DOI: 10.1016/j.ins.2010.10.021
|View full text |Cite
|
Sign up to set email alerts
|

Cyclic codes over R=Fp+uFp+⋯+uk−1Fp with length psn

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…In this paper, we provide a new way different from the methods used in [7], [9] and [11] to determine the algebraic structures of a class of (δ + αu 2 )constacyclic codes over the finite chain ring F p m [u]/ u e for e = 4.…”
Section: Lemma 12mentioning
confidence: 99%
“…In this paper, we provide a new way different from the methods used in [7], [9] and [11] to determine the algebraic structures of a class of (δ + αu 2 )constacyclic codes over the finite chain ring F p m [u]/ u e for e = 4.…”
Section: Lemma 12mentioning
confidence: 99%
“…The class of finite chain rings has been extensively used as the alphabet of constacyclic codes [8,[13][14][15][16][17][18][19][20][21][22][23][24]. This class was introduced in [23] to construct new sequences posessing optimal Hamming correlation properties, and these sequences were found to be useful in frequency hopping multiple-access (FHMA) spreading spectrum communication systems.…”
Section: Introductionmentioning
confidence: 99%
“…Ozger et al [22] discussed constacyclic codes over R under the condition p = 2, k = 4. Recently, in [15], Mu Han et al classified cyclic codes of length np s over R in case of r = 1 via DFT. Motivated by the above cited studies, the main objective of this paper is to extend the approach of Han et al [15] and to obtain unique polynomial representations of constacyclic codes of any finite length N over R with arbitrary invariants p, r, and k. This paper is organized as follows.…”
Section: Introductionmentioning
confidence: 99%
“…+ u k−1 Z 2 (u k = 0) for the rank and minimal spanning of this family of codes. For the case of m = 1, Han et al [13] studied cyclic codes over R = F p + uF p + . .…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we study the latter problem for the special case of p = 2, k = 1, n is an odd positive integer and e = 4. Specifically, using linear code theory over finite chain rings we provide a new way different from the methods used in [13], [18] and [20] to give a complete classification and an explicit enumeration for (δ + αu 2 )-constacyclic codes of length 2n over the finite chain ring F 2 m [u]/ u 4 . We will adopt the following notations.…”
Section: Introductionmentioning
confidence: 99%