Improved asymptotic bounds for error-correcting codes
From MaRDI portal
Cited in
(7)- Algebraic theory of block codes detecting independent errors
- On the upper bound of the size of the \(r\)-cover-free families
- List decoding of number field codes
- Upper bounds for constant weight error correcting codes
- Uniform hypergraphs containing no grids
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- List decoding of maximal order codes over number fields
This page was built for publication: Improved asymptotic bounds for error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768969)