Publication

Almost impossible E_8 and Leech lattices

Related publications (45)

Graph Chatbot

Chat with Graph Search

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.

Amenable hyperbolic groups

Nicolas Monod

We give a complete characterization of the locally compact groups that are nonelementary Gromov-hyperbolic and amenable. They coincide with the class of mapping tori of discrete or continuous one-parameter groups of compacting automorphisms. We moreover gi ...

European Mathematical Soc2015

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

2014

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Ieee2014

L-2-Betti numbers and Plancherel measure

Henrik Densing Petersen, Alain Valette

We compute L-2-Betti numbers of postliminal, locally compact, unimodular groups in terms of ordinary dimensions of reduced cohomology with coefficients in irreducible unitary representations and the Plancherel measure. This allows us to compute the L-2-Bet ...

Academic Press Inc Elsevier Science2014

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

Annika Meyer

Let L be a lattice in . This paper provides two methods to obtain upper bounds on the number of points of L contained in a small sphere centered anywhere in . The first method is based on the observation that if the sphere is sufficiently small then the la ...

Springer US2013

Dirac Optimal Reduction

Tudor Ratiu, Madeleine Jotz

The purpose of this paper is to generalize the (Poisson) Optimal Reduction Theorem in Ortega and Ratiu [Momentum Maps and Hamiltonian Reduction. Progress in Mathematics 222. Boston, MA: Birkhauser. xxxiv, 497pp., 2004] to general proper Lie group actions o ...

Oxford University Press2013

A Micro-Uav with the Capability of Direct Georeferencing

Jan Skaloud, Martin Rehak, Romain Mabillard

This paper presents the development of a low cost UAV (Unmanned Aerial Vehicle) with the capability of direct georeferencing. The advantage of such system lies in its high maneuverability, operation flexibility as well as capability to acquire image data w ...

ISPRS Archives2013

A lattice in more than two Kac–Moody groups is arithmetic

Nicolas Monod

Let Gamma be an irreducible lattice in a product of n infinite irreducible complete Kac–Moody groups of simply laced type over finite fields. We show that if n>2, then each Kac–Moody groups is in fact a simple algebraic group over a local field and Gamma i ...

2012

Crossbar switch decoder for vector signaling codes

Mohammad Amin Shokrollahi

An efficient decoding of vector signaling codes is obtained using a circuit that ranks received signal levels, designates ranked values as representing particular code elements, and translates those particular code elements into a decoded result. An optimi ...

2012

Triangle generation of finite exceptional groups of low rank

Claude Marion

Given a triple (p(1), p(2), p(3)) of primes, the object of this paper is the study of the space Hom(T-p1,T-p2,T-p3, G) of homomorphisms from the triangle group T-p1,T-p2,T-p3 to a finite simple exceptional group G of Lie type B-2(2), (2)G(2), G(2) or D-3(4 ...

Elsevier2011