Three new constructions of optimal linear codes with few weights
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 c...
Saved in:
Main Authors: | Cheng, Yingjie, Cao, Xiwang, Luo, Gaojun |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/173494 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
by: Luo, Gaojun, et al.
Published: (2022) -
Asymmetric quantum Griesmer codes detecting a single bit-flip error
by: Luo, Gaojun, et al.
Published: (2022) -
On the weights of linear codes with prescribed automorphisms
by: Luo, Gaojun, et al.
Published: (2024) -
Constructions of optimal binary locally recoverable codes via a general construction of linear codes
by: Luo, Gaojun, et al.
Published: (2021) -
Linear authentication codes: Bounds and constructions
by: Wang, H., et al.
Published: (2014)