Results 11 to 20 of about 524,250 (218)
The likelihood encoder for source coding [PDF]
The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for known results, such as rate-distortion theory.
Paul Cuff, Eva C. Song
openaire +2 more sources
ABSTRACT Background Pediatric sarcomas are a heterogeneous group of tumors that contribute disproportionately to cancer mortality in children. Although congenital anomalies are among the strongest known risk factors for childhood cancer, the risk of specific sarcoma subtypes among affected individuals has not yet been thoroughly evaluated. Procedure We
Russ Wolters +17 more
wiley +1 more source
On locally decodable source coding [PDF]
Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that such codes require significantly more redundancy (in particular have vanishing rate) compared to their non-local ...
Makhdoumi, Ali +3 more
openaire +3 more sources
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
Expansion Coding for Channel and Source Coding
42 pages, 10 ...
Hongbo Si +3 more
openaire +2 more sources
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Polar codes are optimal for lossy source coding [PDF]
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a successive decoding strategy.
Satish Babu Korada, Rüdiger L. Urbanke
openaire +3 more sources
Tau acetylation at K331 has limited impact on tau pathology in vivo
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Performance of polar codes for channel and source coding [PDF]
Polar codes, introduced recently by Arıkan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking.
Nadine Hussami +2 more
openaire +2 more sources

