On the weights of linear codes with prescribed automorphisms
The number of nonzero weights of a linear code is essential in coding theory as it unveils salient properties of the code, such as its covering radius. In this paper, we establish two upper bounds on the number of nonzero weights of a linear code with prescribed automorphism. Our bounds are applicab...
Saved in:
Main Authors: | Luo, Gaojun, Cao, Xiwang, Ezerman, Martianus Frederic, Ling, San |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/174998 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The weights in MDS codes
by: Ezerman, M.F., et al.
Published: (2014) -
The weights in MDS codes
by: Ezerman, Martianus Frederic, et al.
Published: (2019) -
Three new constructions of optimal linear codes with few weights
by: Cheng, Yingjie, et al.
Published: (2024) -
s-Extremal Additive Codes over GF(4)
by: Bautista, Evangeline P, et al.
Published: (2006) -
Asymmetric quantum Griesmer codes detecting a single bit-flip error
by: Luo, Gaojun, et al.
Published: (2022)