Abstract
Fu and Shen gave an upper bound on binary constant weight codes. In this paper, we present a new proof for the bound of Fu and Shen and characterize binary constant weight codes meeting this bound. It is shown that binary constant weight codes meet the bound of Fu and Shen if and only if they are generated from certain symmetric designs and quasi-symmetric designs in combinatorial design theory. In particular, it turns out that the existence of binary codes with even length meeting the Grey–Rankin bound is equivalent to the existence of certain binary constant weight codes meeting the bound of Fu and Shen. Furthermore, some examples are listed to illustrate these results. Finally, we obtain a new upper bound on binary constant weight codes which improves on the bound of Fu and Shen in certain case.
Similar content being viewed by others
References
Bracken C (2006) New classes of self-complementary codes and quasi-symmetric designs. Des Codes Cryptogr 41(3):319–323
Bracken C, McGuire G, Ward HN (2006) New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. Des Codes Cryptogr 41(2):195–198
Delsarte P (1973) An algebraic approach to the association schemes of coding theory. Philips Res Rep Suppl 10
Fu F-W, Shen S-Y (2001) An upper bound for binary constant weight codes. J Stat Plan Infer 94(2):197–203
Fu F-W, Wei VK (2002) Self-complementary balanced codes and quasi-symmetric designs. Des Codes Cryptogr 27(3):271–279
Grey LD (1962) Some bounds for error-correcting codes. IEEE Trans Inf Theory 8:200–202
Jungnickel D, Tonchev VD (1991) Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound. Des Codes Cryptogr 1:247–253
Jungnickel D, Tonchev VD (1992) On symmetric and quasi-symmetric designs with the symmetric difference property and their codes. J Comb Theory Ser A 59:40–50
MacWilliams FJ, Sloane NJA (1981) The theory of error-correcting codes. North-Holland, Amsterdam
McGuire G (1997) Quasi-symmetric designs and codes meeting the Grey-Rankin bound. J Comb Theory Ser A 78:280–291
Rankin RA (1955) The closest packing of spherical caps in n dimensions. Proc Glasgow Math Assoc 2:139–144
Rankin RA (1956) On the minimal points of positive definite quadratic forms. Mathematika 3:15–24
Shrikhande MS (1996) Quasi-symmetric designs. In: Colbourn CJ, Dinitz JH (eds) The CRC handbook of combinatorial designs Part IV, Section 37. CRC, New York
Shrikhande MS, Sane SS (1991) Quasi-symmetric designs. Cambridge University Press, Cambridge
Tonchev VD (1986) Quasi-symmetric designs and self-dual codes. European J Comb 7:67–73
Tonchev VD (1993) Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom Dedicata 48:295–308
Tonchev VD (1998) Codes and designs. In: Pless VS, Huffman WC (eds) Handbook of coding theory Chap. 15. North-Holland, Amsterdam
Trung TV (1996) Symmetric designs. In: Colbourn CJ, Dinitz JH (eds) The CRC handbook of combinatorial designs Part I, Section 5. CRC, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported in part by the DSTA research grant R-394-000-025-422 and the National Natural Science Foundation of China under the Grant 60402031, and the NSFC-GDSF joint fund under the Grant U0675001
Rights and permissions
About this article
Cite this article
Fu, FW., Xia, ST. The characterization of binary constant weight codes meeting the bound of Fu and Shen. Des Codes Crypt 43, 9–20 (2007). https://doi.org/10.1007/s10623-007-9049-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9049-6
Keywords
- Binary codes
- Binary constant weight codes
- Grey-Rankin boundm
- Distance distribution
- Quasi-symmetric designs