Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes
Torleiv Kløve, Jinquan Luo · IEEE Transactions on Information Theory · 2012
Upper bounds on the weight distribution function for codes of minimum distance at least 2 are given. Codes, where the bound is met with equality, are characterized. An improved upper bound on the weight distribution function for codes of minimum distance at least 3 is given. As an application, a sharp upper bound on the probability of undetected error for linear codes with full support is characterized.