Concept

Binary code

Related publications (19)

Robust Binary Models by Pruning Randomly-initialized Networks

Sabine Süsstrunk, Mathieu Salzmann, Chen Liu, Ziqi Zhao

Robustness to adversarial attacks was shown to require a larger model capacity, and thus a larger memory footprint. In this paper, we introduce an approach to obtain robust yet compact models by pruning randomly-initialized binary networks. Unlike adversar ...

2022

High speed, complex wavefront shaping using the digital micro-mirror device

Demetri Psaltis, Ahmed Ayoub

Digital micro-mirror devices (DMDs) have been deployed in many optical applications. As compared to spatial light modulators (SLMs), they are characterized by their much faster refresh rates (full-frame refresh rates up to 32 kHz for binary patterns) compa ...

Nature Portfolio2021

Almost impossible E_8 and Leech lattices

Maryna Viazovska

We start this short note by introducing two remarkable mathematical objects: the E8E8 root lattice Lambda8Lambda8 in 8-dimensional Euclidean space and the Leech lattice Lambda24Lambda24 in 24-dimensional space. These two lattices stand out among their lat ...

2021

Impact of a companion and of chromospheric emission on the shape of chromosome maps for globular clusters

Carmela Lardo

Context. Globular clusters (GCs) host multiple populations of stars that are well-separated in a photometric diagram - the chromosome map - built from specific Hubble Space Telescope (HST) filters. Stars from different populations feature at various locati ...

EDP SCIENCES S A2020

Decisions under Binary Messaging over Adaptive Networks

Ali H. Sayed

We consider an adaptive network made of interconnected agents engaged in a binary decision task. It is assumed that the agents cannot deliver full-precision messages to their neighbors, but only binary messages. For this scenario, a modified version of the ...

IEEE COMPUTER SOC2018

An Ergodic Theory of Binary Operations-Part II: Applications to Polarization

Rajai Nasser

An open problem in polarization theory is to determine the binary operations that always lead to polarization (in the general multilevel sense) when they are used in Arikan style constructions. This paper, which is presented in two parts, solves this probl ...

Institute of Electrical and Electronics Engineers2017

An Ergodic Theory of Binary Operations-Part I: Key Properties

Rajai Nasser

Ieee-Inst Electrical Electronics Engineers Inc2016

Ergodic Theory Meets Polarization I: A Foundation of Polarization Theory

Rajai Nasser

An open problem in polarization theory is to determine the binary operations that always lead to polarization when they are used in Arıkan style constructions. This paper solves this problem by providing a necessary and sufficient condition for a binary op ...

IEEE2015

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Digitization Technique for UWB Receiver and Capacitive Sensor Interface

Shenjie Wang

As CMOS processes continue to scale to smaller dimensions, the increased fT of the devices and smaller parasitic capacitance allow formore power efficient and faster digital circuits to be made. But at the same time, output impedance of transistors has gon ...

EPFL2014

Distributed Group Testing Detection in Sensor Networks

Pascal Frossard, Tamara Tosic

We consider the problem of failure detection in sensor networks and we propose a new distributed detection algorithm based on Group Testing. We examine the presence of defective sensors by employing tests over locally gathered sensor measurements. Tests ar ...

2012

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder

We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Source and channel coding using Fountain codes

Bertrand Ndzana Ndzana

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

EPFL2009

The Gigavision Camera

Martin Vetterli, Edoardo Charbon, Sabine Süsstrunk, Luciano Sbaiz, Feng Yang

We propose a new image device called gigavision camera. The main differences between a conventional and a gigavision camera are that the pixels of the gigavision camera are binary and orders of magnitude smaller. A gigavision camera can be built using stan ...

2009

Long-Term Monitoring Of Bright Blazars With A Dedicated Cherenkov Telescope

Mathieu Ribordy, Werner Lustermann, Thomas Günther Bretz

Flaring activity of Active Galactic Nuclei (AGN) in VHE gamma-ray astronomy is observed on timescales from minutes to years and can be explained either by the interaction of relativistic jets with the surrounding material or by imprints of the central engi ...

2009

Parity-regular Steinhaus graphs

Maxime Augier

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...

American Mathematical Society2008

Nouvelles approches synthétiques de prodrogues de cyclosporine A et d'analogues antiviraux

Jérémy Bérard

The cyclosporins comprise a family of cyclic 11-peptides containing seven N-methylated, hydrophobic amino acids. Cyclosporine A (CsA) representing the major member of this family is widely used as immunosuppressive agent in organ transplantations. The biol ...

EPFL2008

Linear Cryptanalysis of Non Binary Ciphers (with an application to SAFER)

Serge Vaudenay, Thomas Baignères, Jacques Stern

In this paper we re-visit distinguishing attacks. We show how to generalize the notion of linear distinguisher to arbitrary sets. Our thesis is that our generalization is the most natural one. We compare it with the one by Granboulan et al. from FSE'06 by ...

Springer2007

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...

2005