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

PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION ENGINEERING（2014）

引用 0|浏览1

暂无评分

摘要

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.

查看译文

关键词

Weight Distributions,divisible codes,Griesmer Bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要