High dimensional affine codes whose square has a designed minimum distance (Q782859): Difference between revisions

Given a linear code \(C\) the Shur product is defined by \[ C^{(2)}=\left\langle\{c*c\mid c\in C\}\right\rangle, \] where \(c*c=(c_1c_1,\ldots,c_nc_n)\), for \(c=(c_1,\ldots,c_n)\). It is well known that for some cryptographical applications, private information retrieval or multiparty computations among others, the knowledge of \(C^{(2)}\) is of particular interest. In certain protocols for multiparty computations, both a large minimum distance for \(C^{(2)}\) and a large dimension for \(C\) are desired. According to the previous motivations, the authors study the parameters of \(C^{(2)}\) when the code \(C\) is an affine variety code. Actually for a fix designed minimun distance \(d\), they study those affine variety codes \(C\) such that the minimum distance \(d(C^{(2)})\ge d\) and the dimension of \(C\) are simultaneously high. They prove that the best performance, in general, is for hyperbolic codes, although, surprisely for small \(d\) the best codes are weighted Reed-Muller codes.