Skip to main content
Log in

Self-dual codes from 3-class association schemes

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

3-Class association schemes are used to construct binary self-dual codes. We use the pure and bordered construction to get self-dual codes starting from the adjacency matrices of symmetric and non-symmetric 3-class association schemes. In some specific cases, we also study constructions of self-dual codes over \({\mathbb {Z}}_k\). For symmetric 3-class association schemes, we focus on the rectangular scheme and association schemes derived from symmetric designs.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bannai, E., Dougherty, S.T., Harada, M., Oura, M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inform. Theory 45(4), 1194–1205 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bouyuklieva, S.: A method for constructing self-dual codes with an automorphism of order 2. IEEE Trans. Inform. Theory 46(2), 496–504 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bouyuklieva, S., Bouyukliev, I.: An algorithm for classification of binary self-dual codes. IEEE Trans. Inform. Theory 58(6), 3933–3940 (2012)

    Article  MathSciNet  Google Scholar 

  4. Bouyuklieva, S., Varbanov, Z.: Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Adv. Math. Commun. 5(2), 191–198 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dougherty, S.T., Gulliver, T.A., Ramadurai, R.: Symmetric designs and self-dual codes over rings. Ars Combin. 85, 193–209 (2007)

    MATH  MathSciNet  Google Scholar 

  6. Dougherty, S.T., Kim, J.L., Kulosman, H., Liu, Hongwei: Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 16(1), 14–26 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dougherty, S.T., Kim, J.L., Liu, H.: Constructions of self-dual codes over finite commutative chain rings. Int. J. Inf. Coding Theory 1(2), 171–190 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dougherty, S.T., Kim, J.L., Solé, P.: Double circulant codes from two class association schemes. AMC 1(1), 45–64 (2007)

    Article  MATH  Google Scholar 

  9. Higman, D.G.: Coherent configurations. Geom. Dedicata 4, 1–32 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  10. Huffman, W.C., Pless, V.S.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  11. Hughes, D.R., Piper, F.C.: Design Theory. Cambridge University Press, Cambridge (1985)

    Book  MATH  Google Scholar 

  12. Jørgensen, L.K.: Non-symmetric 3-class association schemes: Research Report Series; R-2005-13 Aalborg Universitetsforlag (2005)

  13. Karadeniz, S., Yildiz, B.: Double-circulant and bordered-double-circulant constructions for self-dual codes over R2. Adv. Math. Commun. 6(2), 193–202 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lam, C.W.H.: The search for a finite projective plane of order 10 [MR1103185 (92b:51013)]. Organic mathematics (Burnaby, BC, 1995), pp. 335–355, CMS Conf. Proc., 20, Am. Math. Soc., Providence, RI (1997)

  15. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1981)

    Google Scholar 

  16. Nebe, G., Rains, E.M., Sloane, N.J.: Self-dual codes and invariant theory. Algorithms and Computation in Mathematics, 17. Springer-Verlag, Berlin, xxviii+430 pp. ISBN: 978-3-540-30729-7; 3-540-30729-X (2006)

  17. Rains, E., Sloane, N.J.A.: Self-dual Codes in the Handbook of Coding Theory, V.S. Pless and W.C. Huffman, pp. 177–294. Elsevier, Amsterdam (1998)

  18. Solé, P.: Self-dual Codes and Self-dual Designs. IMA Volumes 20, pp. 188–192. Springer, Berlin (1990)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. Borges.

Additional information

This work has been supported by the Spanish MEC Grant TIN2013-40524-P and the Catalan AGAUR Grant 2014 SGR691. This paper was presented in part at 3rd International Castle Meeting on Coding Theory and its Applications, and in VIII Jornadas de Matemática Discreta y Algorítmica.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bilal, M., Borges, J., Dougherty, S.T. et al. Self-dual codes from 3-class association schemes. AAECC 26, 227–250 (2015). https://doi.org/10.1007/s00200-014-0238-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-014-0238-z

Keywords

Navigation