Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation:
Serdica Journal of Computing, Vol. 12, No 4, (2018), 219p-226p
Abstract:
In this paper we consider additive circulant graph (ACG) codes over F4 of
length n >= 34 and we present some new results for the number of these codes.
The most important result is that there exists a unique ACG code over F4 of
length 36 and minimum weight 11.
