Bordered constructions of self-dual codes from group rings and new extremal binary self-dual codes (Q2422157): Difference between revisions

A new approach on the classical bordered construction for binary self-dual codes is shown. The classical construction uses a circulant matrix \(A\) such that \(AA^T=-I_n\) and constructs a code with generator matrix \[B=(b_{ij})=\left\{\begin{array}{ll} a_{i-1,j-1}, & i,j\geq 2;\\ \gamma, & i=j=1; \\ \alpha, & i\neq j, i=1\ \hbox{or}\ j=1. \end{array}\right.\] for suitable \(\gamma, \alpha.\) The new construction is established by modifying the constructions by introducing a border to \(I_n\) as well as to the matrix \(A\) used in the group ring constructions. This new construction is used over the binary field and the ring \(R_1=\mathbb{F}_2+u\mathbb{F}_2, u^2=1,\) for groups of orders 9, 15, 21, 25, 27, 33 and 35. New extremal binary self-dual codes of lengths 20, 32, 40, 44, 52, 56, 64, 68, 88 and best known binary self-dual codes of length 72 are found as application of the theoretical results. A total of 41 new binary extremal self-dual codes of length 68 from groups of orders 15 and 33 are found using neighboring and extension methods in addition to the bordered group ring constructions.