Low-complexity fixed-length and sequential tests for statistical sequence matching are proven exponentially consistent, with explicit error exponents for discrete and continuous sequences.
Large and sm all deviations for statistical sequence matching,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Exponentially Consistent Low Complexity Tests for Statistical Sequence Matching
Low-complexity fixed-length and sequential tests for statistical sequence matching are proven exponentially consistent, with explicit error exponents for discrete and continuous sequences.