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...
Main Authors: | Luo, Gaojun, Cao, Xiwang, Ezerman, Martianus Frederic, Ling, San |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/174998 |
Similar Items
-
On propagation rules for entanglement-assisted quantum codes
by: Luo, Gaojun, et al.
Published: (2024) -
CSS-like constructions of asymmetric quantum codes
by: Ezerman, Martianus Frederic, et al.
Published: (2019) -
Spectral bounds for quasi-twisted codes
by: Ezerman, Martianus Frederic, et al.
Published: (2020) -
On the generalised rank weights of quasi-cyclic codes
by: Lim, Enhui, et al.
Published: (2022) -
On List-Decodability of Random Rank Metric Codes and Subspace Codes
by: Ding, Yang
Published: (2016)