Introduces asymmetric Hamming bidistance to derive a new upper bound on average error probability under maximum-likelihood decoding for binary codes over asymmetric channels, shown to be incomparable to prior bounds.
Constructions of combinatori al neural codes with asymmetric discrepancy
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
Introduces asymmetric Hamming bidistance to derive a new upper bound on average error probability under maximum-likelihood decoding for binary codes over asymmetric channels, shown to be incomparable to prior bounds.