A non-cyclic triple-error-correcting BCH-like code and some minimum distance results

被引：0

作者：

Carl Bracken

Faruk Göloğlu

机构：

[1] Nanyang Technology University,Department of Mathematics, School of Physical & Mathematical Sciences

[2] University College Dublin,School of Mathematical Sciences

来源：

Designs, Codes and Cryptography | 2014年 / 72卷

关键词：

BCH codes; Minimum distance; Cyclic codes; APN functions; 68P30; 94B15; 06E30;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper, we give the first example of a non-cyclic triple-error-correcting code which is not equivalent to the primitive BCH code. It has parameters [63, 45, 7]. We also give better bounds on minimum distances of some [2n − 1, 2n - 3n - 1] cyclic codes with three small zeroes. Finally, we reprove weight distribution results of Kasami for triple-error-correcting BCH-like codes using direct methods.

引用

页码：317 / 330

页数：13