Abstract
By considering the null space of incidence matrices of trivial designs over GF(2) (the space of 1- (v,k) trades overGF(2)) we obtain families of codes which are optimal for some v and k. Moreover, by generalizing the concept of bond space, the weight enumerator polynomials for these codes are obtained.
Similar content being viewed by others
References
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North Holland, Amsterdam (1976).
A. S. Hedayat, The theory of trade-off for t-designs, Coding Theory and Design Theory, Part II, Design Theory (D. Ray-Chaduhuri, ed.), IMA Math. Appl., Springer, New York, Vol. 21 (1990) pp. 101-126.
D. Jungnickel and S. A. Vanstone, An application of coding theory to a problem in graphical enumeration, Arch. Math., Vol. 65 (1995) pp. 461-464.
D. Jungnickel and S. A. Vanstone, Graphical codes revisited, IEEE Trans. Inform. Th., Vol. 43,No. 1 (1997) pp. 136-146.
G. B. Khosrovshahi, R. Naserasr and B. Tayfeh-Rezaie, Ternary trades and their codes, to appear.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam (1977).
J. H. van Lint, Introduction to Coding Theory, Berlin-Heidelberg-New York (1982).
R. M. Wilson, A diagonal form for the incidence matrices of t-subsets vs. k-subsets, European J. Combin., Vol. 11 (1990) pp. 609-615.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Khosrovshahi, G.B., Naserasr, R. Hypergraphical Codes Arising from Binary Trades. Designs, Codes and Cryptography 18, 183–186 (1999). https://doi.org/10.1023/A:1008349506366
Issue Date:
DOI: https://doi.org/10.1023/A:1008349506366