Results 41 to 50 of about 2,216,193 (279)
Partial Spreads in Random Network Coding [PDF]
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular, following an idea in
Gorla, Elisa, Ravagnani, Alberto
core
Balancing Cyclic $R$-ary Gray Codes [PDF]
New cyclic $n$-digit Gray codes are constructed over $\{0, 1, \ldots, R-1 \}$ for all $R \ge 3$, $n \ge 2$. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each $n \ge 2$, every transition count is within $R-1$ of the average $R^n/n$, and for the $2$-digit codes every ...
Flahive, Mary, Bose, Bella
openaire +2 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Multiset Combinatorial Batch Codes
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from ...
Silberstein, Natalia +2 more
core +1 more source
Linear Codes over $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$ and their Applications
In the paper, we explore the simplex and MacDonald codes over the finite ring $\mathbb{Z}_{p}\mathcal{R}_{1} \mathcal{R}_{2}$. Our investigation focuses on the unique properties of these codes, with the particular attention to their weight distributions ...
K. Chatouh
doaj +1 more source
A Unique Representation of Cyclic Codes over GR(pn,r)
Let R be a Galois ring, GR(pn,r), of characteristic pn and of order pnr. In this article, we study cyclic codes of arbitrary length, N, over R. We use discrete Fourier transform (DFT) to determine a unique representation of cyclic codes of length, N, in ...
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
The newfound relationship between extrachromosomal DNAs and excised signal circles
Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley +1 more source
Algebraic List-decoding of Subspace Codes [PDF]
Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case).
Mahdavifar, Hessam, Vardy, Alexander
core
On Double Cyclic Codes and Applications to DNA Codes
In this paper, we investigate the structure of double cyclic codes of length (α,β) over R=F4+ϱF4,ϱ2=0 and give a minimal spanning set of double cyclic codes. Moreover, we extend this study to construct DNA codes from R-double cyclic codes.
Amal S. Alali +2 more
doaj +1 more source
On the Generalized Hamming Weights of (
Locally repairable codes (LRCs) have attracted a lot of interests recently due to their important applications in distributed storage systems. An (n, k, r, δ)-LRC (δ ≥ 2) is an [n, k, d] linear code such that each of the n code ...
Jie Hao, Bin Chen
doaj +1 more source

