# American Institute of Mathematical Sciences

May  2020, 14(2): 379-395. doi: 10.3934/amc.2020026

## Additive Toeplitz codes over $\mathbb{F}_{4}$

 1 Department of Mathematics, Faculty of Science, Ankara University, Ankara, 06100, Turkey 2 Department of Mathematics, Faculty of Arts and Sciences, Nevşehir Hacı Bektaş Veli University, Nevşehir, 50300, Turkey

* Corresponding author: Hayrullah Özimamoğlu

Received  October 2018 Revised  March 2019 Published  September 2019

In this paper, we introduce additive Toeplitz codes over $\mathbb{F}_{4}$. The additive Toeplitz codes are a generalization of additive circulant codes over $\mathbb{F}_{4}$. We find many optimal additive Toeplitz codes (OATC) over $\mathbb{F}_{4}$. These optimal codes also contain optimal non-circulant codes, so we find new additive codes in this manner. We provide some theorems to partially classify OATC. Then, we give a new algorithm that fully classifies OATC by combining these theorems with Gaborit's algorithm. We classify OATC over $\mathbb{F}_{4}$ of length up to $13$. We obtain $2$ inequivalent optimal additive toeplitz codes (IOATC) that are non-circulant codes of length $5$, $92$ of length $8$, $2068$ of length $9$, and $39$ of length $11$. Moreover, we improve an idea related to quadratic residue codes to construct optimal and near-optimal additive Toeplitz codes over $\mathbb{F}_{4}$ of length prime $p$. We obtain many optimal and near-optimal additive Toeplitz codes for some primes $p$ from this construction.

Citation: Murat Şahİn, Hayrullah Özİmamoğlu. Additive Toeplitz codes over $\mathbb{F}_{4}$. Advances in Mathematics of Communications, 2020, 14 (2) : 379-395. doi: 10.3934/amc.2020026
##### References:

show all references

##### References:
Number of OATC
 $\boldsymbol{n}$ $\boldsymbol{d_{max}}$ $\boldsymbol{\#}$ All OATC $\boldsymbol{\#}$ OATC with $\boldsymbol{r_{a}}\leq \boldsymbol{s_{b}}$ $2$ $2$ $1$ $1$ $3$ $2$ $8$ $6$ $4$ $3$ $2$ $2$ $5$ $3$ $36$ $26$ $6$ $4$ $1$ $1$ $7$ $4$ $6$ $6$ $8$ $4$ $292$ $197$ $9$ $4$ $4338$ $2709$ $10$ $5$ $24$ $24$ $11$ $5$ $325$ $292$ $12$ $6$ $6$ $6$ $13$ $6$ $?$ $28$
 $\boldsymbol{n}$ $\boldsymbol{d_{max}}$ $\boldsymbol{\#}$ All OATC $\boldsymbol{\#}$ OATC with $\boldsymbol{r_{a}}\leq \boldsymbol{s_{b}}$ $2$ $2$ $1$ $1$ $3$ $2$ $8$ $6$ $4$ $3$ $2$ $2$ $5$ $3$ $36$ $26$ $6$ $4$ $1$ $1$ $7$ $4$ $6$ $6$ $8$ $4$ $292$ $197$ $9$ $4$ $4338$ $2709$ $10$ $5$ $24$ $24$ $11$ $5$ $325$ $292$ $12$ $6$ $6$ $6$ $13$ $6$ $?$ $28$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 5$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0)$ $(w,0,0,1,1)$ $(w,0,1,1,0)$ $(w,0,1,1,0)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0)$ $(w,0,0,1,1)$ $(w,0,1,1,0)$ $(w,0,1,1,0)$
The Generator Vectors of Optimal Additive Non-Circulant Codes for $n = 5$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,0,1)$ $(w,1,1,0,0)$ $(w,1,0,1,0)$ $(w,0,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,0,1)$ $(w,1,1,0,0)$ $(w,1,0,1,0)$ $(w,0,1,1,1)$
The Generator Vectors of Optimal Additive Toeplitz Code for $p = 2$
 $\boldsymbol{a_{2}}$ $\boldsymbol{b_{2}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{2}}}$ $(w,1)$ Circulant
 $\boldsymbol{a_{2}}$ $\boldsymbol{b_{2}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{2}}}$ $(w,1)$ Circulant
The Generator Vectors of Optimal Additive Toeplitz Codes for $p = 3$
 $\boldsymbol{a_{3}}$ $\boldsymbol{b_{3}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,1,0)$ Non-Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,0,1)$ Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,1,1)$ Non-Circulant $\boldsymbol{u_{N_{3}}}$ $(w,1,0)$ Circulant $\boldsymbol{u_{N_{3}}}$ $(w,1,1)$ Non-Circulant
 $\boldsymbol{a_{3}}$ $\boldsymbol{b_{3}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,1,0)$ Non-Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,0,1)$ Circulant $\boldsymbol{u_{Q_{3}}}$ $(w,1,1)$ Non-Circulant $\boldsymbol{u_{N_{3}}}$ $(w,1,0)$ Circulant $\boldsymbol{u_{N_{3}}}$ $(w,1,1)$ Non-Circulant
The Generator Vectors of Optimal Additive Toeplitz Codes for $p = 5$
 $\boldsymbol{a_{5}}$ $\boldsymbol{b_{5}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,0,0,1)$ Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,0,0)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,1,0)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,0,1,1)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,0,1)$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $(w,0,1,1,0)$ Circulant $\boldsymbol{u_{N_{5}}}$ $(w,1,1,1,0)$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $(w,0,1,1,1)$ Non-Circulant
 $\boldsymbol{a_{5}}$ $\boldsymbol{b_{5}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,0,0,1)$ Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,0,0)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,1,0)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,0,1,1)$ Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $(w,1,1,0,1)$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $(w,0,1,1,0)$ Circulant $\boldsymbol{u_{N_{5}}}$ $(w,1,1,1,0)$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $(w,0,1,1,1)$ Non-Circulant
The Generator Vectors of Optimal Additive Toeplitz Codes for $p = 11$
 $\boldsymbol{a_{11}}$ $\boldsymbol{b_{11}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{11}}}$ $(w,0,1,0,0,0,1,1,1,0,1)$ Circulant $\boldsymbol{u_{N_{11}}}$ $(w,1,0,1,1,1,0,0,0,1,0)$ Circulant
 $\boldsymbol{a_{11}}$ $\boldsymbol{b_{11}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{11}}}$ $(w,0,1,0,0,0,1,1,1,0,1)$ Circulant $\boldsymbol{u_{N_{11}}}$ $(w,1,0,1,1,1,0,0,0,1,0)$ Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Codes for $p = 2$
 $\boldsymbol{a_{2}}$ $\boldsymbol{b_{2}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{2}}}$ $\boldsymbol{u_{N_{2}}}$ Non-Circulant $\boldsymbol{u_{N_{2}}}$ $\boldsymbol{u_{Q_{2}}}$ Non-Circulant $\boldsymbol{u_{N_{2}}}$ $\boldsymbol{u_{N_{2}}}$ Circulant
 $\boldsymbol{a_{2}}$ $\boldsymbol{b_{2}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{2}}}$ $\boldsymbol{u_{N_{2}}}$ Non-Circulant $\boldsymbol{u_{N_{2}}}$ $\boldsymbol{u_{Q_{2}}}$ Non-Circulant $\boldsymbol{u_{N_{2}}}$ $\boldsymbol{u_{N_{2}}}$ Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Code for $p = 3$
 $\boldsymbol{a_{3}}$ $\boldsymbol{b_{3}}$ Circulant/Non-Circulant $\boldsymbol{u_{N_{3}}}$ $\boldsymbol{u_{N_{3}}}$ Non-Circulant
 $\boldsymbol{a_{3}}$ $\boldsymbol{b_{3}}$ Circulant/Non-Circulant $\boldsymbol{u_{N_{3}}}$ $\boldsymbol{u_{N_{3}}}$ Non-Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Codes for $p = 5$
 $\boldsymbol{a_{5}}$ $\boldsymbol{b_{5}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $\boldsymbol{u_{N_{5}}}$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $\boldsymbol{u_{Q_{5}}}$ Non-Circulant
 $\boldsymbol{a_{5}}$ $\boldsymbol{b_{5}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{5}}}$ $\boldsymbol{u_{N_{5}}}$ Non-Circulant $\boldsymbol{u_{N_{5}}}$ $\boldsymbol{u_{Q_{5}}}$ Non-Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Codes for $p = 7$
 $\boldsymbol{a_{7}}$ $\boldsymbol{b_{7}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{7}}}$ $\boldsymbol{u_{Q_{7}}}$ Non-Circulant $\boldsymbol{u_{Q_{7}}}$ $\boldsymbol{u_{N_{7}}}$ Circulant $\boldsymbol{u_{N_{7}}}$ $\boldsymbol{u_{Q_{7}}}$ Circulant
 $\boldsymbol{a_{7}}$ $\boldsymbol{b_{7}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{7}}}$ $\boldsymbol{u_{Q_{7}}}$ Non-Circulant $\boldsymbol{u_{Q_{7}}}$ $\boldsymbol{u_{N_{7}}}$ Circulant $\boldsymbol{u_{N_{7}}}$ $\boldsymbol{u_{Q_{7}}}$ Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Code for $p = 11$
 $\boldsymbol{a_{11}}$ $\boldsymbol{b_{11}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{11}}}$ $\boldsymbol{u_{Q_{11}}}$ Non-Circulant
 $\boldsymbol{a_{11}}$ $\boldsymbol{b_{11}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{11}}}$ $\boldsymbol{u_{Q_{11}}}$ Non-Circulant
The Generator Vectors of Near-Optimal Additive Toeplitz Codes for $p = 13$
 $\boldsymbol{a_{13}}$ $\boldsymbol{b_{13}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{13}}}$ $\boldsymbol{u_{Q_{13}}}$ Circulant $\boldsymbol{u_{N_{13}}}$ $\boldsymbol{u_{N_{13}}}$ Circulant
 $\boldsymbol{a_{13}}$ $\boldsymbol{b_{13}}$ Circulant/Non-Circulant $\boldsymbol{u_{Q_{13}}}$ $\boldsymbol{u_{Q_{13}}}$ Circulant $\boldsymbol{u_{N_{13}}}$ $\boldsymbol{u_{N_{13}}}$ Circulant
Number of Inequivalent Optimal Additive Circulant and Non-Circulant Codes
 $\boldsymbol{n}$ $\boldsymbol{d_{max}}$ $\boldsymbol{\#}$ All Toeplitz Codes $\boldsymbol{\#}$ Circulant Codes $\boldsymbol{\#}$ Non-Circulant Codes $2$ $2$ $1$ $1$ $-$ $3$ $2$ $2$ $2$ $-$ $4$ $3$ $1$ $1$ $-$ $5$ $3$ $4$ $2$ $2$ $6$ $4$ $1$ $1$ $-$ $7$ $4$ $1$ $1$ $-$ $8$ $4$ $102$ $10$ $92$ $9$ $4$ $2083$ $15$ $2068$ $10$ $5$ $3$ $3$ $-$ $11$ $5$ $52$ $13$ $39$ $12$ $6$ $2$ $2$ $-$ $13$ $6$ $2$ $2$ $-$
 $\boldsymbol{n}$ $\boldsymbol{d_{max}}$ $\boldsymbol{\#}$ All Toeplitz Codes $\boldsymbol{\#}$ Circulant Codes $\boldsymbol{\#}$ Non-Circulant Codes $2$ $2$ $1$ $1$ $-$ $3$ $2$ $2$ $2$ $-$ $4$ $3$ $1$ $1$ $-$ $5$ $3$ $4$ $2$ $2$ $6$ $4$ $1$ $1$ $-$ $7$ $4$ $1$ $1$ $-$ $8$ $4$ $102$ $10$ $92$ $9$ $4$ $2083$ $15$ $2068$ $10$ $5$ $3$ $3$ $-$ $11$ $5$ $52$ $13$ $39$ $12$ $6$ $2$ $2$ $-$ $13$ $6$ $2$ $2$ $-$
The Generator Vector of Optimal Additive Circulant Code for $n = 2$
 Upper Generator Vector Lower Generator Vector $(w,1)$ $(w,1)$
 Upper Generator Vector Lower Generator Vector $(w,1)$ $(w,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 3$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0)$ $(w,0,1)$ $(w,1,1)$ $(w,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0)$ $(w,0,1)$ $(w,1,1)$ $(w,1,1)$
The Generator Vector of Optimal Additive Circulant Code for $n = 4$
 Upper Generator Vector Lower Generator Vector $(w,1,1,0)$ $(w,0,1,1)$
 Upper Generator Vector Lower Generator Vector $(w,1,1,0)$ $(w,0,1,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 5$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0)$ $(w,0,0,1,1)$ $(w,0,1,1,0)$ $(w,0,1,1,0)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0)$ $(w,0,0,1,1)$ $(w,0,1,1,0)$ $(w,0,1,1,0)$
The Generator Vectors of Optimal Additive Non-Circulant Codes for $n = 5$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,0,1)$ $(w,1,1,0,0)$ $(w,1,0,1,0)$ $(w,0,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,0,1)$ $(w,1,1,0,0)$ $(w,1,0,1,0)$ $(w,0,1,1,1)$
The Generator Vector of Optimal Additive Circulant Code for $n = 6$
 Upper Generator Vector Lower Generator Vector $(w,0,1,1,1,0)$ $(w,0,1,1,1,0)$
 Upper Generator Vector Lower Generator Vector $(w,0,1,1,1,0)$ $(w,0,1,1,1,0)$
The Generator Vector of Optimal Additive Circulant Code for $n = 7$
 Upper Generator Vector Lower Generator Vector $(w,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1)$
 Upper Generator Vector Lower Generator Vector $(w,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 8$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0)$ $(w,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1)$ $(w,1,0,1,0,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,1,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,0,1,0,1,0,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0)$ $(w,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1)$ $(w,1,0,1,0,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,1,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,0,1,0,1,0,1,1)$
The Generator Vectors of Optimal Additive Non-Circulant Codes for $n = 8$
 Upper Generator Vectors Lower Generator Vectors $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,0,0)$ $(w,1,1,1,0,0,0,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,1,1,1,0,1,0)$ $(w,0,1,1,0,1,0,0)$ $(w,0,1,0,0,1,1,1)$ $(w,1,0,0,1,0,1,0)$ $(w,0,1,0,1,0,1,1)$ $(w,1,0,0,1,0,1,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,0,1,0,0,1)$ $(w,1,0,1,0,1,1,0)$ $(w,0,1,0,1,0,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,0,1,0,1,0,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,0,0,1,0,0,1,1)$ $(w,1,1,0,1,1,0,0)$ $(w,0,1,1,0,0,0,1)$ $(w,1,0,0,1,1,1,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,1,0,1,0,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,1,0,1,1,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,1,1,1,0,0,0)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,1,0,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,1,1,0,0,0)$ $(w,0,1,1,1,0,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,1,1,1,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,1,1,1,0,1,1,0)$ $(w,0,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,0,1,0,1)$ $(w,1,1,0,0,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,1,0,1,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,0,1,1,1,1,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,0,1,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,1,1,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,1,0,1,0,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0)$ $(w,1,0,1,1,1,0,1)$ $(w,1,0,0,0,1,1,0)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,0,1,1,1,0)$ $(w,1,0,1,0,0,0,1)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,0,1,1,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,1,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,0,0)$ $(w,1,1,1,0,0,0,1)$ $(w,0,1,1,0,1,0,0)$ $(w,0,1,1,1,0,1,0)$ $(w,0,1,1,0,1,0,0)$ $(w,0,1,0,0,1,1,1)$ $(w,1,0,0,1,0,1,0)$ $(w,0,1,0,1,0,1,1)$ $(w,1,0,0,1,0,1,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,0,1,0,0,1)$ $(w,1,0,1,0,1,1,0)$ $(w,0,1,0,1,0,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,0,1,0,1,0,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,0,0,1,0,0,1,1)$ $(w,1,1,0,1,1,0,0)$ $(w,0,1,1,0,0,0,1)$ $(w,1,0,0,1,1,1,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,1,0,1,0,1)$ $(w,0,1,0,0,1,0,1)$ $(w,1,1,1,0,1,1,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,1,1,1,0,0,0)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,1,0,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,1,1,0,0,0)$ $(w,0,1,1,1,0,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,0,0,1,1,1,0,1)$ $(w,1,0,1,1,0,0,0)$ $(w,1,1,1,0,1,1,0)$ $(w,0,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,0,1,0,1)$ $(w,1,1,0,0,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,1,0,1,1,0,0)$ $(w,0,0,1,0,1,0,1)$ $(w,1,0,1,1,1,1,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,0,1,1)$ $(w,1,1,0,0,0,1,0)$ $(w,1,1,0,1,1,1,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,1,0,1,0,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,0,1,1,0,1)$ $(w,1,1,0,1,0,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,1,0,0,0)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0)$ $(w,1,0,1,1,1,0,1)$ $(w,1,0,0,0,1,1,0)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,1,1,1,0,0,0)$ $(w,0,1,0,1,1,1,0)$ $(w,1,0,1,0,0,0,1)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,0,1,1,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,1,0,0,0,1)$ $(w,1,0,0,1,1,1,1)$
The Generator Vectors of Optimal Additive Non-Circulant Codes for $n = 8$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0,1,0,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,0,1,1,1,1,0,1)$ $(w,0,0,1,0,1,1,0)$ $(w,1,1,1,1,0,1,1)$ $(w,1,0,0,0,1,0,1)$ $(w,1,1,1,0,0,0,1)$ $(w,1,0,0,0,1,0,1)$ $(w,1,1,1,0,1,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,1,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,0,0,1)$ $(w,1,0,1,0,1,0,0)$ $(w,0,1,1,0,1,0,1)$ $(w,1,0,0,1,1,0,0)$ $(w,0,1,0,1,1,1,0)$ $(w,1,0,0,1,1,0,0)$ $(w,1,1,1,0,1,1,0)$ $(w,1,0,0,1,1,0,0)$ $(w,1,1,0,1,1,1,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,1,1,0,1,1,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,1,0,1,1,1,1)$ $(w,0,0,0,1,1,1,0)$ $(w,0,1,1,1,0,1,0)$ $(w,0,0,0,1,1,1,0)$ $(w,0,1,1,1,0,1,1)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,1,1,0,1)$ $(w,0,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,1,0,0,1,1,0)$ $(w,1,1,1,1,0,0,1)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,1,0,1,1)$ $(w,0,0,1,0,1,1,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,1,1)$ $(w,1,0,1,0,1,1,0)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,0,1)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,1,1)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,1,1,0,1)$ $(w,0,1,1,0,1,0,1)$ $(w,1,1,1,1,0,1,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,1,1,1,0,1,1)$ $(w,0,0,1,1,0,1,1)$ $(w,1,0,1,1,1,1,1)$ $(w,0,1,0,1,1,1,0)$ $(w,0,1,1,0,1,1,1)$ $(w,1,0,1,0,0,1,1)$ $(w,0,1,1,1,1,1,0)$ $(w,1,0,1,1,1,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,1,0,1,1)$ $(w,1,0,1,1,0,1,0)$ $(w,1,1,1,0,1,1,0)$ $(w,1,0,1,1,0,1,0)$ $(w,1,1,1,0,0,1,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,0,1,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,1,1,0)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,1,0,0,1,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,1,1,1,0,1,1)$ $(w,1,0,1,1,1,0,1)$ $(w,0,1,0,1,1,1,1)$ $(w,0,1,1,1,0,1,1)$ $(w,1,0,1,0,1,1,1)$ $(w,0,1,1,0,1,1,1)$ $(w,1,1,1,0,1,0,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,0,1,0,0)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,1,1,0,0)$ $(w,1,0,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,1,0)$ $(w,0,1,1,1,1,0,1)$ $(w,0,0,1,0,1,1,0)$ $(w,1,1,1,1,0,1,1)$ $(w,1,0,0,0,1,0,1)$ $(w,1,1,1,0,0,0,1)$ $(w,1,0,0,0,1,0,1)$ $(w,1,1,1,0,1,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,0,1,1,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,1,0,0)$ $(w,1,0,0,0,0,1,1)$ $(w,1,1,0,1,0,0,1)$ $(w,1,0,1,0,1,0,0)$ $(w,0,1,1,0,1,0,1)$ $(w,1,0,0,1,1,0,0)$ $(w,0,1,0,1,1,1,0)$ $(w,1,0,0,1,1,0,0)$ $(w,1,1,1,0,1,1,0)$ $(w,1,0,0,1,1,0,0)$ $(w,1,1,0,1,1,1,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,1,1,0,1,1,0)$ $(w,0,0,0,1,0,1,1)$ $(w,1,1,0,1,1,1,1)$ $(w,0,0,0,1,1,1,0)$ $(w,0,1,1,1,0,1,0)$ $(w,0,0,0,1,1,1,0)$ $(w,0,1,1,1,0,1,1)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,1,1,0,0)$ $(w,1,1,0,0,0,0,1)$ $(w,1,0,1,1,1,0,1)$ $(w,0,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,1,0,0,1,1,0)$ $(w,1,1,1,1,0,0,1)$ $(w,0,1,0,1,1,0,1)$ $(w,0,0,1,1,0,1,1)$ $(w,0,0,1,0,1,1,1)$ $(w,1,0,1,1,1,0,0)$ $(w,0,0,1,0,1,1,1)$ $(w,1,0,1,0,1,1,0)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,0,1)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,0,1,1,1)$ $(w,0,0,1,1,1,1,0)$ $(w,0,1,1,1,1,0,1)$ $(w,0,1,1,0,1,0,1)$ $(w,1,1,1,1,0,1,0)$ $(w,0,0,1,1,0,1,1)$ $(w,0,1,1,1,0,1,1)$ $(w,0,0,1,1,0,1,1)$ $(w,1,0,1,1,1,1,1)$ $(w,0,1,0,1,1,1,0)$ $(w,0,1,1,0,1,1,1)$ $(w,1,0,1,0,0,1,1)$ $(w,0,1,1,1,1,1,0)$ $(w,1,0,1,1,1,0,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,0,1,1,0)$ $(w,1,1,0,1,0,1,1)$ $(w,1,0,1,1,0,1,0)$ $(w,1,1,1,0,1,1,0)$ $(w,1,0,1,1,0,1,0)$ $(w,1,1,1,0,0,1,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,0,1,1)$ $(w,1,1,0,0,0,1,1)$ $(w,1,1,0,1,1,1,0)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,0,0,1,0,1)$ $(w,1,1,1,0,0,1,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,0,0,1,1,0,1)$ $(w,1,1,1,1,0,1,1)$ $(w,1,0,1,1,1,0,1)$ $(w,0,1,0,1,1,1,1)$ $(w,0,1,1,1,0,1,1)$ $(w,1,0,1,0,1,1,1)$ $(w,0,1,1,0,1,1,1)$ $(w,1,1,1,0,1,0,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 9$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,1,0,0,0,0)$ $(w,0,0,0,0,1,0,1,1)$ $(w,0,1,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0)$ $(w,1,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1,1)$ $(w,1,0,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,0,1)$ $(w,0,1,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,1,0)$ $(w,0,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0,0)$ $(w,1,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1,1)$ $(w,1,0,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,0,1)$ $(w,0,0,1,1,1,1,0,0)$ $(w,0,0,1,1,1,1,0,0)$ $(w,0,1,1,1,1,1,0,0)$ $(w,0,0,1,1,1,1,1,0)$ $(w,1,1,0,1,0,0,1,0)$ $(w,0,1,0,0,1,0,1,1)$ $(w,1,1,1,1,0,0,1,0)$ $(w,0,1,0,0,1,1,1,1)$ $(w,1,1,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,1,1)$ $(w,1,1,0,1,0,1,1,0)$ $(w,0,1,1,0,1,0,1,1)$ $(w,1,1,1,1,0,1,1,0)$ $(w,0,1,1,0,1,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,1,0,1,0,0,0,0)$ $(w,0,0,0,0,1,0,1,1)$ $(w,0,1,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0)$ $(w,1,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1,1)$ $(w,1,0,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,0,1)$ $(w,0,1,0,1,1,0,0,0)$ $(w,0,0,0,1,1,0,1,0)$ $(w,0,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0,0)$ $(w,1,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1,1)$ $(w,1,0,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,0,1)$ $(w,0,0,1,1,1,1,0,0)$ $(w,0,0,1,1,1,1,0,0)$ $(w,0,1,1,1,1,1,0,0)$ $(w,0,0,1,1,1,1,1,0)$ $(w,1,1,0,1,0,0,1,0)$ $(w,0,1,0,0,1,0,1,1)$ $(w,1,1,1,1,0,0,1,0)$ $(w,0,1,0,0,1,1,1,1)$ $(w,1,1,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,1,1)$ $(w,1,1,0,1,0,1,1,0)$ $(w,0,1,1,0,1,0,1,1)$ $(w,1,1,1,1,0,1,1,0)$ $(w,0,1,1,0,1,1,1,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 10$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1,0,1)$ $(w,1,0,1,0,0,1,1,0,0)$ $(w,0,0,1,1,0,0,1,0,1)$ $(w,0,1,1,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,1,1,0)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,1,1,0,1,0,0,0)$ $(w,0,0,0,1,0,1,1,0,1)$ $(w,1,0,1,0,0,1,1,0,0)$ $(w,0,0,1,1,0,0,1,0,1)$ $(w,0,1,1,0,1,1,1,0,0)$ $(w,0,0,1,1,1,0,1,1,0)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 11$
 Upper Generator Vectors Lower Generator Vectors $(w,0,0,1,0,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,0,1,0,0)$ $(w,0,1,0,0,0,0,0,1,1,1)$ $(w,1,1,1,0,0,0,0,0,1,0)$ $(w,1,0,1,0,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,0,1,0,1)$ $(w,0,1,1,0,1,0,0,0,1,0)$ $(w,0,1,0,0,0,1,0,1,1,0)$ $(w,0,0,0,1,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1,0,0,0)$ $(w,0,0,1,0,0,1,0,0,1,1)$ $(w,1,1,0,0,1,0,0,1,0,0)$ $(w,1,0,1,1,1,0,0,0,0,0)$ $(w,0,0,0,0,0,1,1,1,0,1)$ $(w,0,1,1,1,0,0,1,0,0,1)$ $(w,1,0,0,1,0,0,1,1,1,0)$ $(w,1,1,0,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1,0,1,1)$ $(w,1,1,0,0,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,0,0,1,1)$ $(w,1,0,1,1,0,0,0,1,1,0)$ $(w,0,1,1,0,0,0,1,1,0,1)$ $(w,0,0,1,1,0,0,1,0,1,1)$ $(w,1,1,0,1,0,0,1,1,0,0)$ $(w,0,1,0,0,0,1,1,1,0,1)$ $(w,1,0,1,1,1,0,0,0,1,0)$
 Upper Generator Vectors Lower Generator Vectors $(w,0,0,1,0,0,1,1,0,1,0)$ $(w,0,1,0,1,1,0,0,1,0,0)$ $(w,0,1,0,0,0,0,0,1,1,1)$ $(w,1,1,1,0,0,0,0,0,1,0)$ $(w,1,0,1,0,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,0,1,0,1)$ $(w,0,1,1,0,1,0,0,0,1,0)$ $(w,0,1,0,0,0,1,0,1,1,0)$ $(w,0,0,0,1,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,1,0,0,0)$ $(w,0,0,1,0,0,1,0,0,1,1)$ $(w,1,1,0,0,1,0,0,1,0,0)$ $(w,1,0,1,1,1,0,0,0,0,0)$ $(w,0,0,0,0,0,1,1,1,0,1)$ $(w,0,1,1,1,0,0,1,0,0,1)$ $(w,1,0,0,1,0,0,1,1,1,0)$ $(w,1,1,0,1,1,0,0,1,0,0)$ $(w,0,0,1,0,0,1,1,0,1,1)$ $(w,1,1,0,0,1,0,1,1,0,0)$ $(w,0,0,1,1,0,1,0,0,1,1)$ $(w,1,0,1,1,0,0,0,1,1,0)$ $(w,0,1,1,0,0,0,1,1,0,1)$ $(w,0,0,1,1,0,0,1,0,1,1)$ $(w,1,1,0,1,0,0,1,1,0,0)$ $(w,0,1,0,0,0,1,1,1,0,1)$ $(w,1,0,1,1,1,0,0,0,1,0)$
The Generator Vectors of Optimal Additive Non-Circulant Codes for $n = 11$
 Upper Generator Vectors Lower Generator Vectors $(w,0,1,0,0,0,0,0,1,1,1)$ $(w,1,1,1,0,1,0,1,1,0,1)$ $(w,0,1,1,1,0,0,1,0,0,0)$ $(w,1,0,1,0,1,0,0,0,1,1)$ $(w,1,1,0,0,0,1,0,1,0,0)$ $(w,1,0,1,0,1,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0,0,1,0)$ $(w,1,1,0,0,0,0,1,0,1,1)$ $(w,0,1,1,0,1,0,0,0,1,0)$ $(w,1,1,0,1,1,1,1,0,0,0)$ $(w,1,0,0,0,0,1,0,0,1,1)$ $(w,1,1,1,1,0,1,1,1,1,0)$ $(w,0,0,0,0,1,0,1,1,0,1)$ $(w,1,1,1,1,0,1,0,0,0,0)$ $(w,0,0,0,1,1,0,0,1,1,0)$ $(w,1,1,1,0,0,1,1,0,0,0)$ $(w,0,0,1,0,1,0,0,1,0,1)$ $(w,1,0,1,0,1,1,0,1,0,0)$ $(w,0,1,0,0,0,1,1,0,1,0)$ $(w,0,1,1,0,1,0,0,1,1,0)$ $(w,0,0,1,0,0,0,1,1,1,0)$ $(w,1,1,0,1,1,0,1,0,1,0)$ $(w,1,0,1,0,0,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0,1,0,1)$ $(w,1,1,0,0,0,0,1,0,0,1)$ $(w,1,1,1,0,1,1,1,1,0,0)$ $(w,1,1,0,1,0,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0,1,1)$ $(w,1,1,0,0,0,0,0,1,1,0)$ $(w,0,1,1,0,0,1,0,1,1,0)$ $(w,0,0,1,1,0,0,0,1,1,0)$ $(w,1,0,1,1,1,1,1,0,1,1)$ $(w,0,1,0,0,1,1,0,1,0,0)$ $(w,0,1,0,0,1,1,1,1,1,1)$ $(w,0,1,0,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0,0,1,1)$ $(w,0,0,0,1,0,1,1,0,0,1)$ $(w,1,0,0,1,1,0,1,1,0,0)$ $(w,0,0,0,0,1,0,1,0,1,1)$ $(w,1,1,0,1,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,1,1)$ $(w,0,0,1,0,1,1,0,1,0,0)$ $(w,1,0,1,0,1,1,0,1,0,0)$ $(w,1,0,1,0,0,1,0,0,1,0)$ $(w,1,0,1,0,0,1,0,0,1,0)$ $(w,1,0,1,1,0,0,0,1,0,0)$ $(w,1,1,1,1,0,1,0,0,1,1)$ $(w,1,0,1,1,0,0,0,1,1,0)$ $(w,1,0,1,1,1,1,0,1,1,0)$ $(w,0,1,1,0,0,1,0,1,0,1)$ $(w,1,1,1,1,1,0,0,1,1,0)$ $(w,0,0,1,1,1,0,1,1,0,0)$ $(w,1,0,1,1,0,1,1,1,0,0)$ $(w,1,0,0,1,1,0,0,0,1,1)$ $(w,0,1,1,0,1,0,1,0,1,0)$ $(w,0,0,0,1,1,0,1,1,1,0)$ $(w,1,0,0,1,1,0,1,1,0,0)$ $(w,0,1,0,0,1,0,1,1,1,0)$ $(w,0,1,0,1,1,1,1,0,0,1)$ $(w,1,0,0,1,1,0,0,1,0,1)$ $(w,0,1,0,1,1,1,1,1,0,1)$ $(w,0,0,0,1,1,1,0,1,0,1)$ $(w,1,0,1,0,1,0,1,1,0,0)$ $(w,0,0,0,1,0,1,1,0,1,1)$ $(w,1,1,0,1,1,0,1,0,0,1)$ $(w,0,1,1,1,1,0,0,0,1,0)$ $(w,1,1,0,0,0,1,1,1,1,0)$ $(w,0,1,1,0,0,0,1,1,0,1)$ $(w,0,0,1,1,0,1,1,1,0,1)$ $(w,1,1,1,0,1,1,0,0,0,1)$ $(w,0,1,0,1,1,1,1,1,0,0)$ $(w,0,1,0,1,1,1,1,0,0,1)$ $(w,1,0,1,1,1,0,1,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,0,1,0,0,0,0,0,1,1,1)$ $(w,1,1,1,0,1,0,1,1,0,1)$ $(w,0,1,1,1,0,0,1,0,0,0)$ $(w,1,0,1,0,1,0,0,0,1,1)$ $(w,1,1,0,0,0,1,0,1,0,0)$ $(w,1,0,1,0,1,0,0,0,1,1)$ $(w,1,1,0,1,0,0,0,0,1,0)$ $(w,1,1,0,0,0,0,1,0,1,1)$ $(w,0,1,1,0,1,0,0,0,1,0)$ $(w,1,1,0,1,1,1,1,0,0,0)$ $(w,1,0,0,0,0,1,0,0,1,1)$ $(w,1,1,1,1,0,1,1,1,1,0)$ $(w,0,0,0,0,1,0,1,1,0,1)$ $(w,1,1,1,1,0,1,0,0,0,0)$ $(w,0,0,0,1,1,0,0,1,1,0)$ $(w,1,1,1,0,0,1,1,0,0,0)$ $(w,0,0,1,0,1,0,0,1,0,1)$ $(w,1,0,1,0,1,1,0,1,0,0)$ $(w,0,1,0,0,0,1,1,0,1,0)$ $(w,0,1,1,0,1,0,0,1,1,0)$ $(w,0,0,1,0,0,0,1,1,1,0)$ $(w,1,1,0,1,1,0,1,0,1,0)$ $(w,1,0,1,0,0,1,0,1,0,0)$ $(w,0,0,1,0,1,1,0,1,0,1)$ $(w,1,1,0,0,0,0,1,0,0,1)$ $(w,1,1,1,0,1,1,1,1,0,0)$ $(w,1,1,0,1,0,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0,1,1)$ $(w,1,1,0,0,0,0,0,1,1,0)$ $(w,0,1,1,0,0,1,0,1,1,0)$ $(w,0,0,1,1,0,0,0,1,1,0)$ $(w,1,0,1,1,1,1,1,0,1,1)$ $(w,0,1,0,0,1,1,0,1,0,0)$ $(w,0,1,0,0,1,1,1,1,1,1)$ $(w,0,1,0,0,1,1,1,0,0,0)$ $(w,0,0,0,1,1,1,0,0,1,1)$ $(w,0,0,0,1,0,1,1,0,0,1)$ $(w,1,0,0,1,1,0,1,1,0,0)$ $(w,0,0,0,0,1,0,1,0,1,1)$ $(w,1,1,0,1,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,1)$ $(w,1,1,0,0,1,1,0,0,0,0)$ $(w,1,0,0,0,1,1,0,0,1,1)$ $(w,0,0,1,0,1,1,0,1,0,0)$ $(w,1,0,1,0,1,1,0,1,0,0)$ $(w,1,0,1,0,0,1,0,0,1,0)$ $(w,1,0,1,0,0,1,0,0,1,0)$ $(w,1,0,1,1,0,0,0,1,0,0)$ $(w,1,1,1,1,0,1,0,0,1,1)$ $(w,1,0,1,1,0,0,0,1,1,0)$ $(w,1,0,1,1,1,1,0,1,1,0)$ $(w,0,1,1,0,0,1,0,1,0,1)$ $(w,1,1,1,1,1,0,0,1,1,0)$ $(w,0,0,1,1,1,0,1,1,0,0)$ $(w,1,0,1,1,0,1,1,1,0,0)$ $(w,1,0,0,1,1,0,0,0,1,1)$ $(w,0,1,1,0,1,0,1,0,1,0)$ $(w,0,0,0,1,1,0,1,1,1,0)$ $(w,1,0,0,1,1,0,1,1,0,0)$ $(w,0,1,0,0,1,0,1,1,1,0)$ $(w,0,1,0,1,1,1,1,0,0,1)$ $(w,1,0,0,1,1,0,0,1,0,1)$ $(w,0,1,0,1,1,1,1,1,0,1)$ $(w,0,0,0,1,1,1,0,1,0,1)$ $(w,1,0,1,0,1,0,1,1,0,0)$ $(w,0,0,0,1,0,1,1,0,1,1)$ $(w,1,1,0,1,1,0,1,0,0,1)$ $(w,0,1,1,1,1,0,0,0,1,0)$ $(w,1,1,0,0,0,1,1,1,1,0)$ $(w,0,1,1,0,0,0,1,1,0,1)$ $(w,0,0,1,1,0,1,1,1,0,1)$ $(w,1,1,1,0,1,1,0,0,0,1)$ $(w,0,1,0,1,1,1,1,1,0,0)$ $(w,0,1,0,1,1,1,1,0,0,1)$ $(w,1,0,1,1,1,0,1,1,1,1)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 12$
 Upper Generator Vectors Lower Generator Vectors $(w,0,0,1,0,1,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,1,0,1,0,0)$ $(w,0,1,1,0,1,1,1,1,0,1,0)$ $(w,0,1,0,1,1,1,1,0,1,1,0)$
 Upper Generator Vectors Lower Generator Vectors $(w,0,0,1,0,1,1,1,0,1,0,0)$ $(w,0,0,1,0,1,1,1,0,1,0,0)$ $(w,0,1,1,0,1,1,1,1,0,1,0)$ $(w,0,1,0,1,1,1,1,0,1,1,0)$
The Generator Vectors of Optimal Additive Circulant Codes for $n = 13$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,1,0,0,1,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0,0,1,0,1)$ $(w,1,1,1,0,1,1,1,1,1,0,1,0)$ $(w,0,1,0,1,1,1,1,1,0,1,1,1)$
 Upper Generator Vectors Lower Generator Vectors $(w,1,0,1,0,0,1,1,1,0,0,0,0)$ $(w,0,0,0,0,1,1,1,0,0,1,0,1)$ $(w,1,1,1,0,1,1,1,1,1,0,1,0)$ $(w,0,1,0,1,1,1,1,1,0,1,1,1)$
 [1] Hongwei Liu, Jingge Liu. On $\sigma$-self-orthogonal constacyclic codes over $\mathbb F_{p^m}+u\mathbb F_{p^m}$. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020127 [2] Yuan Cao, Yonglin Cao, Hai Q. Dinh, Ramakrishna Bandi, Fang-Wei Fu. An explicit representation and enumeration for negacyclic codes of length $2^kn$ over $\mathbb{Z}_4+u\mathbb{Z}_4$. Advances in Mathematics of Communications, 2021, 15 (2) : 291-309. doi: 10.3934/amc.2020067 [3] Hai Q. Dinh, Bac T. Nguyen, Paravee Maneejuk. Constacyclic codes of length $8p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020123 [4] Shudi Yang, Xiangli Kong, Xueying Shi. Complete weight enumerators of a class of linear codes over finite fields. Advances in Mathematics of Communications, 2021, 15 (1) : 99-112. doi: 10.3934/amc.2020045 [5] Shanding Xu, Longjiang Qu, Xiwang Cao. Three classes of partitioned difference families and their optimal constant composition codes. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020120 [6] Xiangrui Meng, Jian Gao. Complete weight enumerator of torsion codes. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020124 [7] Saadoun Mahmoudi, Karim Samei. Codes over $\frak m$-adic completion rings. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020122 [8] Agnaldo José Ferrari, Tatiana Miguel Rodrigues de Souza. Rotated $A_n$-lattice codes of full diversity. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020118 [9] Vito Napolitano, Ferdinando Zullo. Codes with few weights arising from linear sets. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020129 [10] Dandan Wang, Xiwang Cao, Gaojun Luo. A class of linear codes and their complete weight enumerators. Advances in Mathematics of Communications, 2021, 15 (1) : 73-97. doi: 10.3934/amc.2020044 [11] San Ling, Buket Özkaya. New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 2021, 15 (1) : 1-8. doi: 10.3934/amc.2020038 [12] Junchao Zhou, Yunge Xu, Lisha Wang, Nian Li. Nearly optimal codebooks from generalized Boolean bent functions over $\mathbb{Z}_{4}$. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020121 [13] Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded Reed-Solomon codes. Advances in Mathematics of Communications, 2021, 15 (2) : 207-218. doi: 10.3934/amc.2020053 [14] Nicola Pace, Angelo Sonnino. On the existence of PD-sets: Algorithms arising from automorphism groups of codes. Advances in Mathematics of Communications, 2021, 15 (2) : 267-277. doi: 10.3934/amc.2020065 [15] Jong Yoon Hyun, Boran Kim, Minwon Na. Construction of minimal linear codes from multi-variable functions. Advances in Mathematics of Communications, 2021, 15 (2) : 227-240. doi: 10.3934/amc.2020055 [16] Sabira El Khalfaoui, Gábor P. Nagy. On the dimension of the subfield subcodes of 1-point Hermitian codes. Advances in Mathematics of Communications, 2021, 15 (2) : 219-226. doi: 10.3934/amc.2020054 [17] Fengwei Li, Qin Yue, Xiaoming Sun. The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes. Advances in Mathematics of Communications, 2021, 15 (1) : 131-153. doi: 10.3934/amc.2020049 [18] Hongming Ru, Chunming Tang, Yanfeng Qi, Yuxiao Deng. A construction of $p$-ary linear codes with two or three weights. Advances in Mathematics of Communications, 2021, 15 (1) : 9-22. doi: 10.3934/amc.2020039 [19] Tingting Wu, Li Liu, Lanqiang Li, Shixin Zhu. Repeated-root constacyclic codes of length $6lp^s$. Advances in Mathematics of Communications, 2021, 15 (1) : 167-189. doi: 10.3934/amc.2020051 [20] Ivan Bailera, Joaquim Borges, Josep Rifà. On Hadamard full propelinear codes with associated group $C_{2t}\times C_2$. Advances in Mathematics of Communications, 2021, 15 (1) : 35-54. doi: 10.3934/amc.2020041

2019 Impact Factor: 0.734