Self-dual additive $ \mathbb{F}_4 $-codes of lengths up to 40 represented by circulant graphs
Ken Saito · Advances in Mathematics of Communications · 2019
In this paper, we consider additive circulant graph codes which are self-dual additive $ \mathbb{F}_4 $-codes. We classify all additive circulant graph codes of length $ n = 30, 31 $ and $ 34 \le n \le 40 $ having the largest minimum weight. We also classify bordered circulant graph codes of lengths up to 40 having the largest minimum weight.