Skip to main content

New Constructions of Constant-Weight Codes

  • Conference paper
Coding, Cryptography and Combinatorics

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 23))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Agrell, A. Vardy and K. Zeger, “Upper Bounds for Constant-Weight Codes,” IEEE Trans. Inform. Theory vol 46, No. 7 Nov. 2000.

    Google Scholar 

  2. J.H. Conway and N.J.A. Sloane Sphere Packings Lattices and Groups 3rd ed. New York: Springer, 1999.

    MATH  Google Scholar 

  3. E.M. Gabidulin, “Theory of Codes with Maximum Rank Distance,” Problems of Information Transmission 21(1), 1985.

    Google Scholar 

  4. T.W. Hungerford Algebra Springer-Verlag, 1974.

    Google Scholar 

  5. T. Johansson, “Authentication Codes for Nontrusting Parties Obtained from Rank Metric Codes,” Designs Codes and Cryptography vol. 6, pp. 205–218, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  6. F.J. MacWilliams and N.J.A. Sloane The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.

    Google Scholar 

  7. E.M. Rains, Table of Constant Weight Binary Codes[Online],Available:http://www.research.att.com/njas/codes/Andw/index.html

  8. S. Roman Coding and Information Theory Springer-Verlag,1992.

    Google Scholar 

  9. 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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics