Results 21 to 30 of about 2,012,640 (258)

On the Hamming Distances of Constacyclic Codes of Length 5p^S

IEEE Access, 2020
Let $p$ be a prime, $s$ , $m$ be positive integers, and $\lambda $ be a nonzero element of the finite field $\mathbb {F}_{p^{m}}$ . In this paper, the algebraic structures of constacyclic codes of length $5~p^{s}~(p\neq 5)$ are obtained, which ...
Hai Q. Dinh, Xiaoqiang Wang, Jirakom Sirisrisakulchai   +2 more
doaj   +1 more source

Some Repeated-Root Constacyclic Codes Over Galois Rings [PDF]

IEEE Transactions on Information Theory, 2017
Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$ is a chain ring.
Hongwei Liu 0003, Youcef Maouche
openaire   +3 more sources

b-Symbol Distance of Constacylic Codes of Length p^s Over F_p^m + uF_p^m

IEEE Access, 2020
In this research paper, the repeated-root constacyclic codes over the chain ring Fpm + uFpm are considered, where p is a prime and m > 0 is any integer. The b-symbol distance for prime power length, i.e.
H. Q. Dinh, Atul Gaur, A. K. Singh, Manoj Kumar Singh, W. Yamaka   +4 more
doaj   +1 more source

Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes [PDF]

Finite Fields and Their Applications, 2013
arXiv admin note: text overlap with arXiv:0906 ...
Sergio R. López-Permouth, Hakan Özadam, Ferruh Özbudak, Steve Szabo   +3 more
openaire   +4 more sources

Repeated-root constacyclic codes of length 3lp and their dual codes

Finite Fields and Their Applications, 2016
Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langleξ\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langleξ^{3lp^{s}}\rangle$, where $ξ$ is a primitive $(q-1)$th root of unity.
Li Liu 0027, Lanqiang Li, Xiaoshan Kai, Shixin Zhu   +3 more
openaire   +5 more sources

Short Low-Rate Non-Binary Turbo Codes [PDF]

, 2012
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields.
Paolini, Enrico, G. Liva, Balazs Matuz, B. Matuz, Marco Chiani, Liva, Gianluigi, Chiani, Marco, Matuz, Balazs, Gianluigi Liva, Enrico Paolini   +9 more
core   +1 more source

Repeated-root constacyclic codes of length 4ℓp

Finite Fields and Their Applications, 2016
Constacyclic codes form a well-known class of linear codes, and are generalizations of cyclic and negacyclic codes. In this paper, we determine generator polynomials of all constacyclic codes of length 4 ź m p n over the finite field F q with q elements, where p , ź are distinct odd primes, q is a power of p and m , n are positive integers.
Anuradha Sharma, Saroj Rani
openaire   +2 more sources

MDS and AMDS symbol-pair codes are constructed from repeated-root codes

CoRR, 2022
27 pages.
Xiuxin Tang, Rong Luo
openaire   +3 more sources

Explicit Representation and Enumeration of Repeated-Root (δ + αu²)-Constacyclic Codes Over F₂^m[u]/‹u^2λ›

IEEE Access, 2020
Let F2(m) be a finite field of 2m elements, λ and k be integers satisfying λ, k ≥ 2 and denote R = F2(m)[u]/(u2λ). Let δ, α ∈ F2(m)×.
Yuan Cao, Yonglin Cao, Hai Q. Dinh, Tushar Bag, Woraphon Yamaka   +4 more
doaj   +1 more source

b-Symbol Distance Distribution of Repeated-Root Cyclic Codes [PDF]

, 2018
6 ...
Mostafanasab, Hojjat, Sevim, Esra Sengelen   +1 more
openaire   +3 more sources