Let Fpm be a finite field of cardinality pm and R= Fpm [u]/〈 u2〉= Fpm+ uFpm (u2= 0), where
p is a prime and m is a positive integer. For any λ∈ F× pm, an explicit representation for all …

Let F 2 m be a finite field of cardinality 2 m, R= F 2 m+ u F 2 m (u 2= 0) and s, n be positive
integers such that n is odd. In this paper, we give an explicit representation for every self …

Faktorisasi polinomial merupakan suatu proses penguraian suatu polinomial berderajat n
menjadi polinomial-polinomial lain yang berderajat lebih kecil dari n. Faktorisasi polinomial …

Let 𝔽 pm be a finite field of cardinality pm, where p is an odd prime, k, λ be positive integers
satisfying λ≥ 2, and denote 𝒦= 𝔽 pm [x]/〈 f (x) λ pk〉, where f (x) is an irreducible …

As a further development and deepening of two examples in the paper (Fan and Zhang,
2017), we construct MDS Galois self-dual constacyclic codes over finite fields. First, we give …

Kode blok adalah skema penyandian yang menggunakan sistem kode-kode pada suatu
lapangan hingga dengan panjang yang sama dan tetap. Kode blok linear atau lebih sering …

Let F pm be a finite field of cardinality pm where p is an odd prime, n be a positive integer
satisfying gcd (n, p)= 1, and denote R= F pm [u]/< ue> where e≥ 4 be an even integer. Let δ …

Let F 2 (m) be a finite field of 2 m elements, λ and k be integers satisfying λ, k≥ 2 and denote
R= F 2 (m)[u]/(u 2λ). Let δ, α∈ F 2 (m)×. For any odd positive integer n, we give an explicit …

Let be any prime, and be positive integers. In this paper, we completely determine the
Hamming distance of all constacyclic codes of length over the finite commutative chain ring …

We give a polynomial representation for additive cyclic codes over $\mathbb {F} _ {p^ 2} $.
This representation will be applied to uniquely present each additive cyclic code by at most …