Results 71 to 80 of about 35,710 (296)

Cyclically permutable representations of cyclic codes

open access: yesDiscrete Applied Mathematics, 2008
A cyclically permutable code is a binary block code of length \(n\) such that each codeword has \(n\) distinct cyclic shifts and such that no codeword can be obtained by one or more cyclic shifts of another codeword. Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple access (CDMA ...
Derek H. Smith, Stephanie Perkins
openaire   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Skew Cyclic Codes Over ℤ4 + u4 With Derivation Based on a New Gray Map and Automorphism

open access: yesIEEE Access
This paper investigates the algebraic structure and properties of skew cyclic codes over the finite chain ring $R = \mathbb {Z}_{4} + u\mathbb {Z}_{4}$ , where $u^{2} = 0$ .
Eda Tekin
doaj   +1 more source

Finding Cliques in Projective Space: A Method for Construction of Cyclic Grassmannian Codes

open access: yesIEEE Access, 2020
In general, the construction of subspace codes or, in particular, cyclic Grassmannian codes in some projective space Pq(n) is highly mathematical and requires substantial computational power for the resulting searches.
Ismael Gutierrez-Garcia   +1 more
doaj   +1 more source

Good quasi-cyclic codes derived from irreducible cyclic codes [PDF]

open access: yes, 2005
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound
Chen, Eric Zhi
core  

The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers

open access: yesMolecular Oncology, EarlyView.
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce   +11 more
wiley   +1 more source

Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3

open access: yesIEEE 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   +1 more source

Decoding of Cluster Array Errors in Row-Cyclic Array Codes [PDF]

open access: yes, 2016
[[abstract]]Row-cyclic array codes equipped with m-metric [13] suitable for parallel channel communication systems have been introduced by the first author in [10] and the notion of cluster/burst array errors were introduced by the first author in [6 ...
Akshaya Kumar Mishra, Sapna Jain
core  

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat   +8 more
wiley   +1 more source

On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6ps

open access: yesIEEE 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   +1 more source

Home - About - Disclaimer - Privacy