On the weights of linear codes with prescribed automorphisms

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...

Full description

Saved in:
Bibliographic Details
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:
Mathematical Sciences
Automorphism
Covering radius
Hamming weight
Linear code
Upper bound
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

Internet

https://hdl.handle.net/10356/174998

Similar Items