Asymptotic bounds on the covering radius of binary codes
From MaRDI portal
DOI10.1109/18.59948zbMATH Open0713.94024OpenAlexW1976729570MaRDI QIDQ3199338FDOQ3199338
Authors: Patrick Solé 
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.59948
Recommendations
weight distributionBCH codescovering radiusReed-Muller codesbinary codesasymptotic boundsquadratic residue codesasymptotically perfect codes
Cited In (20)
- Generalization of the Norse bounds to codes of higher strength
- Title not available (Why is that?)
- Asymptotic minimum covering radius of block codes
- An asymptotic bound on the covering radii of binary BCH codes
- Title not available (Why is that?)
- Some new upper bounds on the covering radius of binary linear codes
- The covering radius of extreme binary 2-surjective codes
- Asymptotic bound on binary self-orthogonal codes
- Covering codes with improved density
- Optimal binary covering codes of length 2j
- Title not available (Why is that?)
- Weight distribution and dual distance
- The covering radius of spherical designs
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- On the covering radius of Reed-Muller codes
- On the asymptotic behaviour of Lee-codes
- On the covering radius of binary codes (Corresp.)
- Title not available (Why is that?)
- Covering radius and dual distance
- Asymptotical properties of linear codes
This page was built for publication: Asymptotic bounds on the covering radius of binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199338)
