Results 21 to 30 of about 258,202 (236)
MDS codes have the highest possible error-detecting and error-correcting capability among codes of given length and size. Let p be any prime, and s, m be positive integers.
H. Q. Dinh +5 more
doaj +1 more source
b-Symbol Distance of Constacylic Codes of Length ps Over Fpm + uFpm
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 +4 more
doaj +1 more source
Some Constacyclic Codes over Finite Chain Rings [PDF]
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes.
Batoul, Aicha +2 more
core +1 more source
Quantum Codes Constructed From Repeated-Root Cyclic Codes
In this paper, we use q-cyclotomic cosets modulo n = q − 1 and generator polynomial to describe repeated-root cyclic codes of length N = pαn. We determine the condition under which a repeated-root cyclic code contains its dual code. Then, for q = 2a, we give a class of dual-containing repeated-root cyclic codes.
Ruihu Li +3 more
openaire +1 more source
Repeated-root Constacyclic Codes with Optimal Locality
A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by accessing only a small number of other symbols, and hence alleviating the network resources required during the ...
Zhao, Wei +2 more
openaire +2 more sources
Repeated-root cyclic codes [PDF]
In the theory of cyclic codes, it is common practice to require that (n,q)=1, where n is the word length and F/sub q/ is the alphabet. It is shown that the even weight subcodes of the shortened binary Hamming codes form a sequence of repeated-root cyclic codes that are optimal.
openaire +1 more source
Repeated-root cyclic and negacyclic codes over a finite chain ring [PDF]
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2.
Berg, R. van den +16 more
core +6 more sources
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 +4 more
doaj +1 more source
A species-specific satellite DNA family in the genome of the coffee root-knot nematode Meloidogyne exigua : Application to molecular diagnostics of the parasite [PDF]
A new Bg/II satellite DNA has been isolated, cloned and sequenced from the coffee root-knot nematode, Meloidogyne exigua (Nematoda: Tylenchida). It is represented as tandemly repeated sequences with a monomeric unit of 277 bp. The monomers are present at
Bongiovanni, Michel +4 more
core +2 more sources
Subspace subcodes of Reed-Solomon codes [PDF]
We introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed-Solomon (SSRS) codes. An SSRS code is a subset of a parent Reed-Solomon (RS) code consisting of the RS codewords whose components all lie in a fixed ...
Hattori, Masayuki +2 more
core +1 more source

