REVIEW 2 cited by
On Error Exponents of Almost-Fixed-Length Channel Codes and Hypothesis Tests
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We examine a new class of channel coding strategies, and hypothesis tests referred to as almost-fixed-length strategies that have little flexibility in the stopping time over fixed-length strategies. The stopping time of these strategies is allowed to be slightly large only on a rare set of sample paths with an exponentially small probability. We show that almost-fixed-length channel coding strategies can achieve Burnashev's optimal error exponent. Similarly, almost-fixed length hypothesis tests are shown to bridge the gap between hypothesis testing with fixed sample size and sequential hypothesis testing and improve the trade-off between type-I and type-II error exponents.
Forward citations
Cited by 2 Pith papers
-
Gravity-Awareness: Deep Learning Models and LLM Simulation of Human Awareness in Altered Gravity
A dual ML framework (EEG-MLP and GP physiology) plus a Claude LLM simulation is presented as a predictive tool for gravity-related awareness, but it is trained and evaluated on synthetic data derived from the literatu...
-
eegFloss: A Python package for refining sleep EEG recordings using machine learning models
eegFloss provides an open-source LightGBM classifier that labels 10-second sleep EEG epochs as usable or artifact-contaminated (weighted F1 ≈ 0.85, κ = 0.78) plus an accelerometer-based time-in-bed estimator.
Discussion (0). Continue with ORCID to comment.