Results 41 to 50 of about 764,565 (289)
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül +2 more
wiley +1 more source
Two Families of Optimal Binary Linear Complementary Pairs of Codes
MathematicsThe optimal security parameters for binary linear complementary pair (LCP) codes are open. Inspired by this, we study LCPs of codes. In this paper, we construct two families of optimal binary LCPs of codes.
Xia Li, Zhaole Li
doaj +1 more source
Optimal Prefix Free Codes with Partial Sorting
Algorithms, 2019 We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O ( n ( 1 + lg α ) ) ⊆ O ( n lg n ) , where the alternation α ∈ [ 1 . .
Jérémy Barbay
doaj +1 more source
Constructions of Binary Locally Repairable Codes With Multiple Recovering Sets
IEEE Access, 2021 Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed storage systems. In this letter, we generalize the construction of WZL code proposed by Wang et al.
Jiaming Teng, Lingfei Jin
doaj +1 more source
Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$
, 2013 Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over finite fields
Ding, Cunsheng, Zhou, Zhengchun
core +2 more sources
Asymptotic optimality of antidictionary codes [PDF]
2010 IEEE International Symposium on Information Theory, 2010 5 pages, to appear in the proceedings of 2010 IEEE International Symposium on Information Theory (ISIT2010)
Ota, Takahiro, Morita, Hiroyoshi
openaire +2 more sources
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source
MMSE Optimal Algebraic Space-Time Codes
, 2007 Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and receive antennas ...
Rajan, B. Sundar, Rajan, G. Susinder
core +1 more source
Real‐time assay of ribonucleotide reductase activity with a fluorescent RNA aptamer
FEBS Letters, EarlyView.Ribonucleotide reductases (RNR) synthesize DNA building blocks de novo, making them crucial in DNA replication and drug targeting. FLARE introduces the first single‐tube real‐time coupled RNR assay, which enables isothermal tracking of RNR activity at nanomolar enzyme levels and allows the reconstruction of allosteric regulatory patterns and rapid ...
Jacopo De Capitani +4 more
wiley +1 more source
Optimal Locally Repairable Linear Codes [PDF]
, 2013 Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum Hamming distance ...
Dau, Son Hoang +3 more
core