Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...
Let be a simple exceptional algebraic group of adjoint type over an algebraically closed field of characteristic and let be a subgroup of containing a regular unipotent element of . By a theorem of Testerman, is contained in a connected subgroup of of type ...
We consider a natural subclass of harmonic maps from a surface into G/T, namely cyclic primitive maps. Here G is any simple real Lie group (not necessarily compact), T is a Cartan subgroup and both are chosen so that there is a Coxeter automorphism on G(C) ...
This article addresses questions about the double centralizer of unipotent elements u in simple algebraic groups G of type and defined over algebraically closed fields of bad characteristic. We use the method developed in [14] to determine , deduce its dim ...
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...
We establish obstructions for groups to act by homeomorphisms on dendrites. For instance, lattices in higher rank simple Lie groups will always fix a point or a pair. The same holds for irreducible lattices in products of connected groups. Further results ...
Let G be a simply connected simple linear algebraic group of exceptional Lie type over an algebraically closed field F of characteristic p >= 0, and let u is an element of G be a non-identity unipotent element. Let phi be a non-trivial irreducible represen ...
Let G be a simple linear algebraic group over an algebraically closed field K of characteristic p≥0. In this thesis, we investigate closed connected reductive subgroups X<G that contain a given distinguished unipotent element u of G. Our ...
Building on Viazovska’s recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particul ...
In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance, we make use of the existing techniques and optimize th ...
