Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3
Fangchi Liang, Yuena Ma, Tao Ku · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2014
Based on a relationship between generator matrix of given code and its weight distribution, all [31s+t, 3] 5(t=7, 13, 19, 25) optimal divisible codes with divisor 5 are determined by solving systems of linear equations. Then their generator matrices and weight polynomials of these optimal divisible codes are also given.