An extremal problem related to the covering radius of binary codes
We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius; we solve the problem in some cases, give some bounds, and also show how it relates to the construction of good codes with distance 3.
Unable to display preview. Download preview PDF.
- [CGM.83]G.D. Cohen, P. Godlewski, and F. Merkx, “Linear Block Codes for Write-Once Memories”, IEEE Trans. on Inf. Theory, IT 29, 3, (1983) 731–739.Google Scholar
- [McS.77]F.J. Mac Williams and N.J.A. Sloane, “The Theory of Error-Correcting Codes” 1977 North Holland Amsterdam.Google Scholar
- [Man.65]H.B. Mann, “Addition theorems”, 1965 Wiley New-York.Google Scholar
- [Zem.89]G. Zémor, “Problèmes combinatoires liés à l'écriture sur des mémoires” Phd dissertation, Nov. 1989.Google Scholar