Concept

Binary number

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.

New distance and depth estimates from observations of eclipsing binaries in the SMC

Pierre North, Romain Gauderon

A sample of 33 eclipsing binaries observed in a field of the SMC with FLAMES@VLT is presented. The radial velocity curves obtained, together with existing OGLE light curves, allowed the determination of all stellar and orbital parameters of these binary sy ...

Cambridge University Press2009

Protection of data from erasures using subsymbol based codes

Mohammad Amin Shokrollahi

An encoder uses output symbol subsymbols to effect or control a tradeoff of computational effort and overhead efficiency to, for example, greatly reduce computational effort for the cost of a small amount of overhead efficiency. An encoder reads an ordered ...

2008

Fluorescent 2'-deoxynucleotides containing a protecting group at the 3'-O-position are reversible terminators enabling array-based DNA sequencing by synthesis (SBS) approaches. Herein, we describe the synthesis of a new family of 3'-OH unprotected cleavabl ...

Oxford University Press2008

, ,

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

We prove the concentration of the capacity, in the large system limit, for a code division multiple access system over an additive white Gaussian noise channel, with Gaussian signature sequences and {\it binary input} symbols. The probabilistic tools that ...

2007

Matrix Implementations

Spyridon Pongas

The project consists in the study, implementation and comparison of binary matrix multiplication algorithms in C++. We consider Strassen’s algorithm (which is known to perform well over the real numbers) the Four Russians algorithm (which is designed for b ...

2005

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

Monitoring systems that can detect path outages and periods of degraded performance are important for many distributed applications. Trivial pairwise probing systems do not scale well and cannot be employed in large networks. To build scalable path monitor ...

2005

Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

When striving for reliability, multicast protocols are most commonly designed as deterministic solutions. Such an approach seems to make the reasoning about reliability guarantees (traditionally binary "all-or-nothing"- like) in the face of packet losses a ...

2004

, ,

We study the capacity regions of various broadband degraded broadcast channels including the degraded Poisson broadcast channel and the degraded very-noisy broadcast channel. It is shown that in the absence of dark current the capacity region of the degrad ...

2003