Results 1 to 10 of about 520,695 (298)
AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes [PDF]
arXiv.org, 2022 Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code.
Junru Ma
semanticscholar +5 more sources
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩ [PDF]
IEEE Access, 2020 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 +3 more sources
Quantum Codes Constructed From Repeated-Root Cyclic Codes
Journal of Physics: Conference Series, 2018 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.
Ruihu Li +3 more
semanticscholar +3 more sources
Repeated-root cyclic codes [PDF]
IEEE Transactions on Information Theory, 1991 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.
J. H. van Lint
semanticscholar +4 more sources
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance [PDF]
Problems of Information Transmission, 2015 The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and
Ulmschneider, Markus, Zeh, Alexander
core +3 more sources
MDS and AMDS symbol-pair codes are constructed from repeated-root codes [PDF]
arXiv.org, 2022 Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed to protect against the pair errors in symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable (MDS) symbol ...
Xiuxin Tang, R. Luo
semanticscholar +3 more sources
On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6
IEEE Access, 2020 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 +2 more sources
AxiomsSymbol-pair codes are a class of block codes with symbol-pair metrics designed to protect against pair errors that may occur in high-density data storage systems.
Wei Zhao, Weixian Li, Hui Chen
openalex +2 more sources
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 +4 more
doaj +2 more sources
Developing the Swiss mid-infrared soil spectral library for local estimation and monitoring [PDF]
SOIL, 2021 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