Abstract
By generalizing a propagation rule for binary constant-weight codes, we present three constructions of binary constant-weight codes. It turns out that our constructions produce binary constant-weight codes with good parameters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Agrell, A. Vardy and K. Zeger, “Upper Bounds for Constant-Weight Codes,” IEEE Trans. Inform. Theory vol 46, No. 7 Nov. 2000.
J.H. Conway and N.J.A. Sloane Sphere Packings Lattices and Groups 3rd ed. New York: Springer, 1999.
E.M. Gabidulin, “Theory of Codes with Maximum Rank Distance,” Problems of Information Transmission 21(1), 1985.
T.W. Hungerford Algebra Springer-Verlag, 1974.
T. Johansson, “Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes,” Designs Codes and Cryptography vol. 6, pp. 205–218, 1995.
F.J. MacWilliams and N.J.A. Sloane The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.
E.M. Rains, Table of Constant Weight Binary Codes[Online],Available:http://www.research.att.com/njas/codes/Andw/index.html
S. Roman Coding and Information Theory Springer-Verlag,1992.
R. Safavi-Naini, H. Wang and C. Xing, “Linear Authentication Codes: Bounds and Constructions,” Indocrypt’01 Lecture Notes in Computer Science Vol. 2247, 2001, pp. 127–135.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Li, L., Long, S. (2004). New Constructions of Constant-Weight Codes. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_13
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive