Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3

被引：0
作者：
Liang, Fangchi [1 ,2 ]
Ma, Yuena [2 ]
Ku, Tao [2 ]
机构：
[1] Xi An Jiao Tong Univ, Sch Math & Stat, Xian, Shaanxi Provinc, Peoples R China
[2] Air Force Engn Univ, Coll Sci, Xian, Shaanxi Provinc, Peoples R China
来源：
PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION ENGINEERING | 2014年 / 111卷
关键词：
Weight Distributions; divisible codes; Griesmer Bound;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：146 / 148
页数：3
相关论文
共 5 条
1