Results 1 to 10 of about 423,036 (174)
MDS symbol-pair codes from repeated-root cyclic codes [PDF]
arXiv admin note: text overlap with arXiv:2010 ...
Junru Ma, Jinquan Luo
openaire +2 more sources
Developing the Swiss mid-infrared soil spectral library for local estimation and monitoring [PDF]
Information on soils' composition and physical, chemical and biological properties is paramount to elucidate agroecosystem functioning in space and over time.
P. Baumann +10 more
doaj +1 more source
Logistic model outperforms allometric regression to estimate biomass of xerophytic shrubs
Allometric model has been applied worldwide to estimate vegetation biomass for decades. However, this model fails to restrict the accelerating increase of biomass as body size grows. That contradicts to the size-related resource limits and intra-specific
Jiemin Ma +5 more
doaj +1 more source
Repeated-root constacyclic codes of length 6lp^s
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Tingting +3 more
openaire +2 more sources
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6
Let $p$ be an odd prime, $s$ , $m$ be positive integers such that $p^{m}\equiv 2 \pmod 3$ . In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all ...
Hai Q. Dinh +2 more
doaj +1 more source
On the Hamming Distances of Constacyclic Codes of Length 5
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 +2 more
doaj +1 more source
On repeated-root cyclic codes [PDF]
A parity-check matrix for a q-ary repeated-root cyclic code is derived using the Hasse derivative. Then the minimum distance of a q-ary repeated-root cyclic code is expressed in terms of the minimum distance of a certain simple-root cyclic code. With the help of this result, several binary repeated-root cyclic codes of lengths up to n=62 are shown to ...
G. Castagnoli +3 more
openaire +1 more source
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
Some Repeated-Root Constacyclic Codes Over Galois Rings [PDF]
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, Youcef Maouche
openaire +2 more sources
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source

