Skip to main content
Log in

Good integers and some applications in coding theory

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

A Correction to this article was published on 18 May 2018

This article has been updated

Abstract

A class of good integers has been introduced by P. Moree in 1997 together with the characterization of good odd integers. Such integers have shown to have nice number theoretical properties and wide applications. In this paper, a complete characterization of all good integers is given. Two subclasses of good integers are introduced, namely, oddly-good and evenly-good integers. The characterization and properties of good integers in these two subclasses are determined. As applications, good integers and oddly-good integers are applied in the study of the hulls of abelian codes. The average dimension of the hulls of abelian codes is given together with some upper and lower bounds.

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.

Institutional subscriptions

Similar content being viewed by others

Change history

  • 18 May 2018

    Proposition 2.1 and Proposition 2.3 in the original publication are incorrectly worded and they should be as follows.

References

  1. Benson, S.: Students ask the darnedest things: a result in elementary group theory. Math. Mag. 70, 207–211 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berman, S.D.: Semi-simple cyclic and abelian codes. Kibernetika 3, 21–30 (1967)

    Google Scholar 

  3. Dicuangco, L., Moree, P., Solé, P.: The lengths of Hermitian self-dual extended duadic codes. J. Pure Appl. Algebra 209, 223–237 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dicuangco-Valdez, L., Moree, P., Solé, P.: On the existence of Hermitian self-dual extended abelian group codes. Springer Proc. Math. Stat. 115, 67–84 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding, C., Kohel, D.R., Ling, S.: Split group codes. IEEE Trans. Inform. Theory 46, 485–495 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fisher, J.L., Sehgal, S.K.: Principal ideal group rings. Comm. Algebra 4, 319–325 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jia, Y., Ling, S., Xing, C.: On self-dual cyclic codes over finite fields. IEEE Trans. Inform. Theory 57, 2243–2251 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jitman, S., Ling, S., Liu, H., Xie, X.: Abelian codes in principal ideal group algebras. IEEE Trans. Inform. Theory 59, 3046–3058 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jitman, S., Ling, S., Solé, P.: Hermitian self-dual Abelian codes. IEEE Trans. Inform. Theory 60, 1496–1507 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jitman, S., Sangwisut, E.: The average dimension of the Hermitian hull of cyclic codes over finite fields of square order. AIP Conference Proceedings 1775, 030026 (2016)

    Article  Google Scholar 

  11. Knee, D., Goldman, H.D.: Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes. IEEE Trans. Inform. Theory 15, 118–121 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  12. Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inform. Theory 28, 496–511 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Leon, J.S.: Permutation group algorithms based on partition i: theory and algorithms. J. Symbolic Comput. 12, 533–583 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Leon, J.S.: Partitions, refinements, and permutation group computation. Discrete Math. Theoret. Comput. Sci. 28, 123–158 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Moree, P.: On the divisors of a k + b k. Acta Arithmetica LXXX, 197–212 (1997)

    Article  MATH  Google Scholar 

  16. Rajan, B.S., Siddiqi, M.U.: Transform domain characterization of abelian codes. IEEE Trans. Inform. Theory 38, 1817–1821 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sangwisut, E., Jitman, S., Ling, S., Udomkavanich, P.: Hulls of cyclic and negacyclic codes over finite fields. Finite Fields Appl. 33, 232–257 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sendrier, N.: Finding the permutation between equivalent binary code. Proc. IEEE ISIT’1997, Ulm, Germany, 367 (1997)

  19. Sendrier, N.: On the dimension of the hull. SIAM J. Appl. Math. 10, 282–293 (1997)

    MathSciNet  MATH  Google Scholar 

  20. Sendrier, N.: Finding the permutation between equivalent codes: the support splitting algorithm. IEEE Trans. Inform. Theory 46, 1193–1203 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  21. Sendrier, N., Skersys, G.: On the computation of the automorphism group of a linear code. Proc. IEEE ISIT’2001, Washington, DC, 13 (2001)

  22. Skersys, G.: The average dimension of the hull of cyclic codes. Discrete Appl. Math. 128, 275–292 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author would like to thank the anonymous referees for their helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Somphong Jitman.

Additional information

This research was supported by the Thailand Research Fund and the Office of Higher Education Commission of Thailand under Research Grant MRG6080012.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jitman, S. Good integers and some applications in coding theory. Cryptogr. Commun. 10, 685–704 (2018). https://doi.org/10.1007/s12095-017-0255-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-017-0255-4

Keywords

Mathematics Subject Classification (2010)

Navigation