A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions
Conghui Xie
2024-06-21 16:30-17:30
MCM610
Speaker: Conghui Xie (Jinan University) Time: 16:30-17:30 June 21, 2024 (Friday)
Venue: MCM610
Title: A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions
Abstract: We give a new upper bound on sizes of linear codes related to weight distributions of codes. This bound is stronger than the Singleton bound for linear codes. Hence we give vanishing partial weight distribution results for many best known linear codes, some almost MDS codes, general small Griesmer defect codes, some BCH codes, and some cyclic codes. Upper bounds on number of nonzero weights of binary Griesmer codes and some small Singleton defect codes are also given.
