scientific article; zbMATH DE number 109193

From MaRDI portal
Publication:4024329





Let \(H=(h_{ij})\) be a normalized Hadamard matrix of order \(n=8t+4\), and \(\overline B\) the \((-1,1)\) matrix of order \(n-1\) obtained from \(H\) by deleting the first row and column. Put \(2B=J+\overline B\), where \(J\) is the all one matrix. Further let \(A=\left({0\atop j}t {j\atop B}\right)\), where \(j\) is a all one vector. Two types of binary codes are considered. One (type 1) has a generator matrix \((I,B)\), and the other (type 2) has a generator matrix \((I,A)\). Further let \[ P_{i_ 1i_ 2\dots i_ k}(H)=\sum^ n_{j=1}h_{i_ 1j}h_{i_ 2j}\dots h_{i_ kj} \] for \(k=1,\dots,n\), where \(\{i_ 1,i_ 2,\dots,i_ k\}\) is a \(k\)-set. Now the main result (Theorem 6) is as follows. The weights of the code of type 2 are \[ k+(1/2)(n\mp P_{i_ 1i_ 2\dots i_ k}(H))+(1+(- 1)^{k+1})/2, \] where \(k\) is even and \(2\leq k\leq(n/2)\). Then they show that the minimum weights of the codes of type 1 and type 2 are not smaller than 7 and 8, respectively.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024329)