Skip to main content
SpringerLink
Log in

Three classes of binary linear codes with good parameters

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

Abstract

Three classes of linear codes with good parameters are constructed in this paper. The length, dimension and minimum distance for each class of linear codes are also investigated by means of the well-known Kloosterman sums over finite fields. It is interesting to note that the constructed three classes of linear codes possess good parameters and some of them are shown to be optimal.

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

Access this article

Log in via an institution

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

References

  1. Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carlitz, L.: Explicit evaluation of certain exponential sums. Math. Scand. 44, 5–16 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dillon, J.F.: Elementary hadamard difference dets. Ph.D. dissertation, Univ. Maryland, College Park (1974)

  4. Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61(6), 3265–3275 (2015)

    Article  MathSciNet  Google Scholar 

  5. Ding, K., Ding, C.: Binary linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014)

    Article  MATH  Google Scholar 

  6. Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory (2015). doi:10.1109/TIT.2015.2473861

    MathSciNet  Google Scholar 

  7. Ding, C., Niederreiter, H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274–2277 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de

  9. Kloosterman, H.D.: On the representation of numbers in the form \(ax^2 + by^2 + cz^2 + dt^2\). Acta Math. 49, 407–464 (1926)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lachaud, G., Wolfmann, J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inf. Theory 36(3), 686–692 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Leander, N.G.: Monomial bent functions. IEEE Trans. Inf. Theory 52(2), 738–743 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics, vol. 20. Cambridge University Press, Cambridge (1983)

    MATH  Google Scholar 

  13. Ling, S., Xing, C., Özbudak, F.: An explicit class of codes with good parameters and their duals. Discrete Appl. Math. 154(2), 346–356 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  15. Mesnager, S.: Semibent functions from Dillon and Niho exponents, Kloosterman sums, and Dickson polynomials. IEEE Trans. Inf. Theory 57(11), 7443–7458 (2011)

    Article  MathSciNet  Google Scholar 

  16. Tang, C., Li, N., Qi, Y., Zhou, Z., Helleseth, T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016)

    Article  MathSciNet  Google Scholar 

  17. Xing, C., Ling, S.: A class of linear codes with good parameters. IEEE Trans. Inf. Theory 46(6), 2184–2188 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Xing, C., Ling, S.: A class of linear codes with good parameters from algebraic curves. IEEE Trans. Inf. Theory 46(4), 1527–1532 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Zhou, Z., Li, N., Fan, C., Helleseth, T.: Linear codes with two or three weights from quadratic bent functions. Des. Codes Cryptogr. doi:10.1007/s10623-015-0144-9

Download references

Acknowledgments

We thank the referees and the editor for their helpful comments and suggestions, which have greatly improved the presentation of the paper.

Author information

Authors and Affiliations

  1. School of Computer Science, Civil Aviation Flight University of China, Guanghan, 618307, Sichuan, China

    Yanling Li & Man Hua

Authors
  1. Yanling Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Man Hua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yanling Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Hua, M. Three classes of binary linear codes with good parameters. AAECC 27, 481–491 (2016). https://doi.org/10.1007/s00200-016-0292-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-016-0292-9

Keywords

Mathematics Subject Classification

Search

Navigation