Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
P. Godlewski, “WOM-codes construits à partir des codes de Hamming”, Discrete Math., 65 (1987), 237–243.
F.J. Mac Williams and N.J.A. Sloane, “The Theory of Error-Correcting Codes” 1977 North Holland Amsterdam.
H.B. Mann, “Addition theorems”, 1965 Wiley New-York.
R.L. Rivest and A. Shamir, “How to reuse a “Write Once” Memory”, Inf. and Control 55, (1982), 1–19.
G. Zémor, “Problèmes combinatoires liés à l'écriture sur des mémoires” Phd dissertation, Nov. 1989.
G. Zémor and G. Cohen, “Error-Correcting WOM-codes”, IEEE Trans. on Inf. Theory, IT 37, 3, (1991) 730–735.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zémor, G. (1992). An extremal problem related to the covering radius of binary codes. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034339
Download citation
DOI: https://doi.org/10.1007/BFb0034339
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive