Results 71 to 80 of about 87,508 (304)
Constructing good covering codes for applications in Steganography
, 2008 . Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations.
Bierbrauer, Jürgen +3 more
core +1 more source
On some classes of block repetition codes with covering radius of the codes Z32
, 2023 In this paper, to obtain the bounds for some classes of repetition codes with covering radius by using various weight and also the same size and different size of length in repetition codes over a finite ring Z32
Pandian P., Chella
core +1 more source
De Bruijn cycles for covering codes [PDF]
Random Structures & Algorithms, 2004 AbstractA de Bruijn covering code is a q‐ary string S so that every q‐ary string is at most R symbol changes from some n‐word appearing consecutively in S. We introduce these codes and prove that they can have size close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra.
Fan R. K. Chung, Joshua N. Cooper
openaire +2 more sources
Molecular Oncology, EarlyView.Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Some Optimal Codes from Algebraic Geometry and Their Covering Radii
, 1990 We show that many Goppa codes from algebraic geometry are optimal. Many of these codes attain the Griesmer bound and provide first examples of Griesmer codes which have relatively large dimension compared with the minimum distance.
Janwa, Heeralal
core +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Covering $b$-Symbol Metric Codes and the Generalized Singleton Bound
, 2023 Symbol-pair codes were proposed for the application in high density storage systems, where it is not possible to read individual symbols. Yaakobi, Bruck and Siegel proved that the minimum pair-distance of binary linear cyclic codes satisfies $d_2 \geq ...
Chen, Hao
core
On a Combinatorial Problem for the Set of Binary Vectors
Известия Иркутского государственного университета: Серия "Математика", 2015 In this paper we introduce a new combinatorial problem for covering binary sets. This problem appears in connection to research of complexity of ESOP.
K.D. Kirichenko
doaj
Journal of the American Heart Association: Cardiovascular and Cerebrovascular DiseaseBackground Heart failure (HF) affects 6.7 million American adults and is associated with significant morbidity and mortality. Cardiac rehabilitation (CR) is a behavior modification program recommended to improve health outcomes in patients with HF.
Saron Hunegnaw +5 more
doaj +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source