Results 31 to 40 of about 258,202 (236)
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 +3 more
openaire +3 more sources
Algebraic Quantum Synchronizable Codes
, 2016 In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of Fujiwara~\cite{fujiwara1} can
Guenda, K. +2 more
core +1 more source
AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
, 2022 arXiv admin note: text overlap with arXiv:2010.04329.
openaire +2 more sources
b-Symbol Distance Distribution of Repeated-Root Cyclic Codes [PDF]
, 2018 6 ...
Mostafanasab, Hojjat +1 more
openaire +2 more sources
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance
, 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 +2 more sources
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 +1 more source
Unified theory for finite Markov chains [PDF]
, 2019 We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$.
Rhodes, John, Schilling, Anne
core +2 more sources
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots [PDF]
Designs, Codes and Cryptography, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ling, S., Niederreiter, H., Solé, P.
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background/Objectives Osteosarcoma is a radioresistant tumor that may benefit from stereotactic body radiation therapy (SBRT) for locoregional control in metastatic/recurrent disease. We report institutional practice patterns, outcomes, toxicity, and failures in osteosarcoma patients treated with SBRT.
Jenna Kocsis +13 more
wiley +1 more source
MDS and AMDS symbol-pair codes constructed from repeated-root codes
, 2022 22 pages.
Tang, Xiuxin, Luo, Rong
openaire +2 more sources