On the error-detecting performance of some classes of block codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1001631 (Why is no real title available?)
- scientific article; zbMATH DE number 3700716 (Why is no real title available?)
- A class of low-rate nonlinear binary codes
- A class of optimum nonlinear double-error-correcting codes
- Correction to 'Some Bounds for Error-Correcting Codes'
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- On some properties of the undetected error probability of linear codes (Corresp.)
- On the minimal points of positive definite quadratic forms
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Some new two-weight codes and strongly regular graphs
- The Closest Packing of Spherical Caps in n Dimensions
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Cited in
(5)- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
- scientific article; zbMATH DE number 1559067 (Why is no real title available?)
- Performance of binary block codes at low signal-to-noise ratios
- Error detection with a class of cyclic codes
- Error Locating Codes By Using Blockwise-Tensor Product of Blockwise Detecting/Correcting Codes
This page was built for publication: On the error-detecting performance of some classes of block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2577277)