Abstract
An upper bound for self-complementary balanced codes is presented in this paper. We give a characterization for self-complementary balanced codes meeting this upper bound. We show that the existence of certain quasi-symmetric designs implies the existence of such optimal self-complementary balanced codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Al-Bassam and B. Bose, Design of efficient error-correcting balanced codes, IEEE Trans. Computers, Vol. 42, No.10 (1993) pp. 1261–1266.
J. M. Berger, A note on error detecting codes for asymmetric channels, Inform. and Control, Vol. 4 (1961) pp. 68–73.
M. Blaum and J. Bruck, Delay-intensitive pipelined communication on parallel buses, IEEE Trans. Computers, Vol. 44, No.5 (1995) pp. 660–668.
B. Bose and T. R. N. Rao, On the theory of unidirectional error correcting/detecting codes, IEEE Trans. Computers, Vol. 31 (1982) pp. 521–530.
A. R. Calderbank, Geometric invariants for quasi-symmetric designs, J. Combin. Theory Ser. A, Vol. 47 (1988) pp. 101–110.
A. R. Calderbank and P. Frankl, Binary codes and quasi-symmetric designs, Disc. Math., Vol. 83 (1990) pp. 201–224.
R. H. Deng and M. A. Herro, DC-free coset codes, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 786–792.
T. Etzion, Constructions of error-correcting dc-free block codes, IEEE Trans. Inform. Theory, Vol. 36, No.4 (1990) pp. 899–905.
C. V. Freiman, Optimal error detecting codes for completely asymmetric binary channels, Inform. and Control, Vol. 5 (1962) pp. 64–71.
K. A. S. Immink, Coding Techniques for Digital Recorders, Prentice-Hall, London (1991).
D. Jungnickel and V. D. Tonchev, Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound, Des. Codes Cryptogr., Vol. 1 (1991) pp. 247–253.
D. Jungnickel and V. D. Tonchev, On symmetric and quasi-symmetric designs with the symmetric difference property and their codes, J. Combin. Theory Ser. A, Vol. 59 (1992) pp. 40–50.
R. Karabed and P. H. Siegel, Matched spectral-null codes for partial-response channels, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 818–855.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1981).
G. McGuire, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, J. Combin. Theory Ser. A, Vol. 78 (1997) pp. 280–291.
R. M. Roth, P. H. Siegel and A. Vardy, High-order spectral-null codes-Constructions and bounds, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 1826–1840.
M. S. Shrikhande and S. S. Sane, Quasi-Symmetric Designs, Cambridge Univ. Press, Cambridge (1991).
M. S. Shrikhande, quasi-symmetric designs, In (C. J. Colbourn and J. H. Dinitz, eds.) The CRC Handbook of Combinatorial Designs, CRC Press Inc., New York (1996) pp. 430–434.
L. G. Tallini and B. Bose, Design of balanced and constant weight codes for VLSI systems, IEEE Trans. Computers, Vol. 47, No.5 (1998) pp. 556–572.
V. D. Tonchev, Quasi-symmetric designs, codes, quadrics, and hyperplane sections, Geom. Dedicata, Vol. 48 (1993) pp. 295–308.
V. D. Tonchev, Quasi-symmetric designs and self-dual codes, European J. Combin., Vol. 7 (1986) pp. 67–73.
H. van Tilborg and M. Blaum, On error-correcting balanced codes, IEEE Trans. Inform. Theory, Vol. 35 (1989) pp. 1091–1095.
T. Verhoeff, Delay-intensitive codes—An overview, Distributed Computing, Vol. 3 (1988) pp. 1–8.
V. A. Zinoviev, On the equivalence of certain constant weight codes and combinatorial designs, J. Statist. Plann. Inference, Vol. 56 (1996) pp. 289–294.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fu, FW., Wei, V.KW. Self-Complementary Balanced Codes and Quasi-Symmetric Designs. Designs, Codes and Cryptography 27, 271–279 (2002). https://doi.org/10.1023/A:1019947222243
Issue Date:
DOI: https://doi.org/10.1023/A:1019947222243