Skip to main content
Log in

Three new constructions of optimal linear codes with few weights

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

Linear codes play a key role in widespread applications. In this paper, we propose three new constructions of linear codes. We give some sufficient conditions for the constructed linear codes to be optimal or distance-optimal in terms of the Griesmer bound. Three classes of distance-optimal linear codes with new parameters are presented. Under some constraints, we show that some of the presented linear codes have few weights.

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

Data availability

Not applicable.

References

Download references

Acknowledgements

The authors would like to thank the anonymous referees and the Associate Editor, Prof. Thomas Aaron Gulliver for their useful comments and suggestions. This research is supported by the National Natural Science Foundation of China under Grant 12171241 and Grant 62172183, China Scholarship Counsil Scholarship Program under Grant 202206830084 and Postgraduate Research & Practice Innovation Program of Jiangsu Province under Grant KYCX22_0324.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gaojun Luo.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest regarding the publication of this paper.

Additional information

Communicated by Thomas Aaron Gulliver.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheng, Y., Cao, X. & Luo, G. Three new constructions of optimal linear codes with few weights. Comp. Appl. Math. 42, 321 (2023). https://doi.org/10.1007/s40314-023-02472-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-023-02472-x

Keywords

Mathematics Subject Classification

Navigation