Code volume boundaries in the additive channel
From MaRDI portal
Recommendations
- An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
- Bounds for codes in the case of list decoding of finite volume
- Bounds for codes in the case of list decoding of finite volume
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Coding for Adder Channels
Cited in
(2)
This page was built for publication: Code volume boundaries in the additive channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939043)