New binary self-dual codes of lengths 80, 84 and 96 from composite matrices (Q2115720)

One of the most used techniques for generating binary self-dual codes is the pure double circulant construction using the matrix \(G = (I_n\mid A)\) where \(A\) is a circulant matrix. This technique has since been generalised by assuming a generator matrix of the form \(G = (I_n |\sigma(v))\) where \(\sigma\) is an isomorphism from a group ring. A composite matrix it this work denotes \(G = (I_n |\Omega(v))\) where \(\Omega(v)\) is a matrix that arises from group rings. The code generated by \(G\) is self-dual if and only if \(\Omega(v)\Omega(v)T = -I_n.\) Using this type of generator matrices for a number of different composite matrices \(\Omega(v)\) over different alphabets \(\mathbb{F}_2,\) \(\mathbb{F}_2 + u\mathbb{F}_2\) and \(\mathbb{F}_4\), the authors find many binary self-dual codes with large length and weight enumerator parameters of previously unknown values. Studying this type of construction the necessary and sufficient conditions needed by each construction to produce a self-dual code are proved. Applying the results, a total of 361 new binary self-dual codes are found, including 28 singly-even binary self-dual \([80, 40, 14]\) codes, 107 binary self-dual \([84, 42, 14]\) codes, 105 singly-even binary self-dual \([96, 48, 16]\) codes and 121 doubly-even binary self-dual \([96, 48, 16]\) codes. All the necessary information for generating these codes as well as the orders of their automorphism group are given in tables.