Results 31 to 40 of about 298,987 (213)
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities [PDF]
This monograph presents a unified treatment of single- and multi-user problems in Shannon's information theory where we depart from the requirement that the error probability decays asymptotically in the blocklength.
Tan, Vincent Y. F.
core
ABSTRACT Objective This analysis evaluates the effect of successful reperfusion on functional outcomes after MT, stratified by admission National Institutes of Health Stroke Scale (NIHSS) and Alberta Stroke Program Early CT Score (ASPECTS) as surrogates for clinical‐core mismatch, using multicenter registry data.
Felix Schlicht +53 more
wiley +1 more source
Coin flipping from a cosmic source: On error correction of truly random bits
We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits $x \in \bits^n$, and $k$ parties, who have noisy versions of the source bits $y^i \in \bits^n$, where for all $i$ and $j$, it holds ...
Mossel, Elchanan, O'Donnell, Ryan
core +2 more sources
ABSTRACT Introduction Glucagon‐like peptide‐1 receptor agonists (GLP‐1 RAs) have demonstrated significant weight‐reducing effects and may offer benefits in idiopathic intracranial hypertension (IIH); however, recent concerns about the risk of non‐arteritic anterior ischemic optic neuropathy (NAION) have emerged.
Faisal A. Al‐Harbi +9 more
wiley +1 more source
Sertraline Treatment Can Mimic Niemann‐Pick Type C Biomarker Profile: A Diagnostic Pitfall
ABSTRACT Background Oxysterols (cholestane‐3β,5α,6β‐triol and 7‐ketocholesterol) and N‐palmitoyl‐O‐phosphocholineserine (PPCS) are sensitive biomarkers for Niemann‐Pick disease type C (NPC) screening. However, false‐positive results occur, with a biomarker profile suggestive of NPC despite the absence of pathogenic variants in genes involved in NPC or ...
Maria Makrygianni +19 more
wiley +1 more source
Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality [PDF]
Recently, a new decoding rule called jar decoding was proposed; under jar decoding, a non-asymptotic achievable tradeoff between the coding rate and word error probability was also established for any discrete input memoryless channel with discrete or ...
Meng, Jin, Yang, En-Hui
core
MOGAD Is the Most Common Cause of Isolated Optic Neuritis in Children
ABSTRACT Objectives The study aimed to characterize the clinical features, etiologies, and outcomes of isolated, first‐time pediatric ON in the post‐MOG‐IgG era. Methods This was a single‐center retrospective cohort study at Texas Children's Hospital of patients diagnosed with first‐time ON between 2018–2024, with follow‐up data collected through 2025.
Chaitanya Aduru +13 more
wiley +1 more source
Strong Secrecy for Erasure Wiretap Channels
We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC).
Bloch, Matthieu +4 more
core +1 more source
ABSTRACT Objective Digital technologies hold promise for transforming healthcare by enhancing personalized treatments and offer valuable opportunities to improve patient care. Here, we evaluated several novel, self‐administered, home‐based, digital endpoints for their association with corresponding conventional standard clinical measures (primary) in ...
Arne Mueller +14 more
wiley +1 more source
Capacity and Random-Coding Exponents for Channel Coding with Side Information
Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error.
Moulin, Pierre, Wang, Ying
core +3 more sources

