New lower bounds for the number of ACG codes over F_4

Authors

  • Zlatko Varbanov Faculty of Mathematics and Informatics, University of Veliko Tarnovo, Bulgaria
  • Maya Hristova Faculty of Mathematics and Informatics, University of Veliko Tarnovo, Bulgaria

DOI:

https://doi.org/10.55630/sjc.2018.12.219-226

Keywords:

ACG, Additive Circulant Graph

Abstract

In this paper we consider additive circulant graph (ACG) codes over F_4 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 F_4 of length 36 and minimum weight 11.

Downloads

Published

2019-01-23

Issue

Vol. 12 No. 4 (2018)

Section

Articles