Results 51 to 60 of about 3,225,248 (329)
Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication [PDF]
Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2018 Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector and matrix-matrix multiplication operations that need to be parallelized across multiple nodes.
Ankur Mallick +2 more
semanticscholar +1 more source
A Family of Ternary Quasi-Perfect BCH Codes
, 2008 In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
Dodunekov, Stefan,, Danev, Danyo,
core +1 more source
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [PDF]
QuantumWe introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard ...
Matthew Steinberg +5 more
doaj +1 more source
Extended binary Golay codes by a group algebra of one group
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2020 Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary self-dual codes with Hamming distance between arbitrary codewords which are multiples of 4 that has the highest possible minimum Hamming distance among ...
М. Ю. Бортош +1 more
doaj +1 more source
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Molecular Oncology, EarlyView.Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena +15 more
wiley +1 more source
Trifferent codes with small lengths
Examples and CounterexamplesA code C⊆{0,1,2}n of length n is called trifferent if for any three distinct elements of C there exists a coordinate in which they all differ. By T(n) we denote the maximum cardinality of trifferent codes with length n.
Sascha Kurz
doaj +1 more source
On the reconstruction of perfect codes
Discrete Mathematics, 2002 For a perfect 1-error correcting binary code \(C\), let \(C(k)\) denote the set of words of \(C\) of weight \(k\). \textit{S. V. Avgustinovich} [Discrete Anal. Issled. Oper. 2, 4-6 (1995; Zbl 0846.94017, Zbl 0861.94018)] has shown that if \(C((n+ 1)/2)= C'((n+ 1)/2)\) for two binary perfect 1-error correcting codes \(C\) and \(C'\) of length \(n\) then
openaire +2 more sources
MDS and I-perfect poset block codes
Finite Fields Their Appl., 2020 We obtain the Singleton bound for poset block codes and define a maximum distance separable poset block code (MDS ( P , π ) -code) as a code meeting this bound. We extend the concept of I-balls to poset block metric and describe r-perfect and MDS ( P , π
B. K. Dass, Namita Sharma, Rashmi Verma
semanticscholar +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source