On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
From MaRDI portal
Publication:3786403
Recommendations
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
- On the covering radius of codes
- On the covering radius of a code and its subcodes
- Bounds for abnormal binary codes with covering radius one
- scientific article; zbMATH DE number 4160649
- A new approach to the covering radius of codes
- On covering radius lower bound for a class of binary codes
- Further results on the covering radius of codes
- On covering radius of codes over \(\mathbb{Z}_{2p}\)
- On the covering radius of subcodes of a code
Cites work
- scientific article; zbMATH DE number 3878836 (Why is no real title available?)
- scientific article; zbMATH DE number 3965968 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A new approach to the covering radius of codes
- Computing automorphism groups of error-correcting codes
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- Minimum-distance bounds for binary linear codes
- On the covering radius of codes
Cited in
(8)- Bounds for binary multiple covering codes
- scientific article; zbMATH DE number 125908 (Why is no real title available?)
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- All binary codes with covering radius one are subnormal
- On the normality of multiple covering codes
- Bounds for abnormal binary codes with covering radius one
- More binary covering codes are normal
- The solution to Berlekamp's switching game
This page was built for publication: On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786403)
