Skip to main content
Log in

Constructing self-dual codes over \(\mathbb{F }_q[u]/(u^t)\)

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Given a self-dual code over \(\mathbb{F }_q[u]/(u^t)\) we present a method to obtain explicitly new self-dual codes of larger length. Conversely, we also prove that, with the appropriate assumptions on length and number of generators, every self-dual code over \(\mathbb{F }_q[u]/(u^t)\) can be obtained in this manner. We use this construction to produce several optimal self-dual codes over the base field in a manner that generalizes the Lee weight. This construction is based on ideas presented by Han et al. (Bull Korean Math Soc, 49:135–143, 2012) and also by Lee and Kim (An efficient construction of self dual codes, 2012), not only generalizing it, but joining the two different cases from the original paper as special cases of one general construction.

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. Alfaro R.: Linear codes over \(\mathbb{F}_q[u]/(u^t)\). Contemp. Math. 537, 1–11 (2011).

  2. Alfaro R., Bennett S., Harvey J., Thornburg C.: On distances and self-dual codes over \(\mathbb{F}_q[u]/(u^t)\). Involv. J. Math. 2(2), 177 (2009).

  3. Dougherty S.T., Gulliver T.A., Harada M.: Type II self-dual codes over finite rings and even unimodular lattices. J. Algebraic Comb. 9(3), 233–250 (1999).

    Google Scholar 

  4. Han S., Lee H., Lee Y.: Construction of self dual codes over \(\mathbb{F}_2+u\mathbb{F}_2\). Bull. Korean Math. Soc. 49(1), 135–143 (2012).

    Google Scholar 

  5. Gulliver A., Harada M.: Codes over \({F}_3+u{F}_3\) and improvements to the bounds on ternary linear codes. Des. Codes Cryptogr. 22, 89–96 (2001).

  6. Huffman W.C.: On the classification and enumeration of self-dual MDS codes. Finite Fields Appl. 11(3), 451–490 (2005).

    Google Scholar 

  7. Lee Y., Kim J.-L.:An efficient construction of self dual codes. arXiv:1201.5689v1[cs.IT] (2012).

  8. Siap I., Ray-Chaudhuri D.: New linear codes over \({F}_3\) and \({F}_5\) and improvements on bounds. Des. Codes Cryptogr. 21, 223–233 (2000).

  9. Ozvudak F., Sole P.: Gilbert–Varshamov type bounds for linear codes over finite chain rings. Adv. Math. Commun. 1, 99–109 (2007).

    Google Scholar 

  10. Kim J.-L.: New extremal self-dual codes of lengths 36, 38, and 58. IEEE Trans. Inf. Theory 47, 386–393 (2001).

    Google Scholar 

  11. Norton G., Salagean A.: On the structure of linear and cyclic codes over a finite chain ring. AAECC 10, 489–506 (2000).

    Google Scholar 

Download references

Acknowledgments

The project was partially supported by Office of Research of the University of Michigan-Flint

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Alfaro.

Additional information

Communicated by G. Korchmaros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alfaro, R., Dhul-Qarnayn, K. Constructing self-dual codes over \(\mathbb{F }_q[u]/(u^t)\) . Des. Codes Cryptogr. 74, 453–465 (2015). https://doi.org/10.1007/s10623-013-9873-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-013-9873-9

Keywords

Mathematics Subject Classification

Navigation