On lower bounds on the spectrum of a binary code
From MaRDI portal
Publication:2190925
Recommendations
- On the undetected error probability for binary codes
- Bounds on the decoding error probability of binary linear codes via their spectra
- A Simple Derivation of the Undetected Error Probabilties of Complementary Codes
- On the relation between the code spectrum and the decoding error probability
- Binomial moments of the distance distribution and the probability of undetected error.
Cites work
- Code spectrum and the reliability function: binary symmetric channel
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 3554145 (Why is no real title available?)
- New upper bounds on error exponents
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On Some Testing of Hypothesis Problems with Information Constraints
- On the BSC reliability function: expanding the region where it is known exactly
- Sharpening of an upper bound for the reliability function of a binary symmetric channel
- Straight-line bound for the undetected error exponent
Cited in
(4)
This page was built for publication: On lower bounds on the spectrum of a binary code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190925)