Optimality of codes with respect to error probability in Gaussian noise
From MaRDI portal
Publication:6282501
arXiv1701.07986MaRDI QIDQ6282501FDOQ6282501
Authors: Alexey Balitskiy, Roman Karasev, Alexander Tsigler 
Publication date: 27 January 2017
Abstract: We consider geometrical optimization problems related to optimizing the error probability in the presence of a Gaussian noise. One famous questions in the field is the "weak simplex conjecture". We discuss possible approaches to it, and state related conjectures about the Gaussian measure, in particular, the conjecture about minimizing of the Gaussian measure of a simplex. We also consider antipodal codes, apply the v{S}id'ak inequality and establish some theoretical and some numerical results about their optimality.
This page was built for publication: Optimality of codes with respect to error probability in Gaussian noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282501)
