Extending Peer-to-Peer Networks for Approximate Search

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.

Peer-to-peer (P2P) sharing may foster sustainability synergistically by saving resources, reducing costs and promoting satisfaction of consumer needs and social connectivity. A survey of Swiss and Swedish consumers (N = 1522) was conducted to analyze drive ...

In the last decade, DNA has been increasingly investigated as an alternative medium for cold data storage, presenting several advantages over standard hard drives such as a higher density, longer lifespan and lower energy consumption. However, such coding ...

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

Collective Remote Attestation (CRA) is a well-established approach where a single Verifier attests the integrity of multiple devices in a single execution of the challenge-response protocol. Current CRA solutions are well-suited for Internet of Things (IoT ...

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

LoRaWAN is a low-power wireless technology that provides long-range connectivity to battery-powered Internet of Things (IoT) devices. To minimize the energy consumption of the IoT nodes, LoRaWAN networks use for the uplink a pure non-slotted ALOHA multiple ...

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

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 ...

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user to construct a h ...

To design faster and more energy-efficient systems, numerous inexact arithmetic operators have been proposed, generally obtained by modifying the logic structure of conventional circuits. However, as the quality of service of an application has to be ensur ...

Virtual reality (VR), the interactive experience of being immersed in a simulated environment, has seen a tremendous development in the last years. Numerous applications came into being, ranging from flight simulators through a virtual ascent of Mount Ever ...

We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for suitable boundary c ...

The performance of unipolar unicolor coded Brillouin optical time-domain analysis (BOTDA) is evaluated based on both Simplex and Golay codes. Four major detrimental factors that limit the system performance, including decoded-gain trace distortion, coding ...

We determine the stability condition of low-density parity-check codes under both bitwise and blockwise maximum a posteriori decoding. As a consequence, we prove that the stability condition determines an upper bound on both the bitwise and the blockwise m ...

Dynamical Systems (DS) are often used to represent motion, with the advantage of being easy to learn from demonstrations. We present a method to modulate DS depending on an external signal, extending our previous work on Locally Modulated DS (LMDS, Kronand ...

The main objective of this paper is to explore the precise relationship between the Bethe free energy (or entropy) and the Shannon conditional entropy of graphical error correcting codes. The main result shows that the Bethe free energy associated with a l ...

For the past 70 years or so, coding theorists have been aiming at designing transmission schemes with efficient encoding and decoding algorithms that achieve the capacity of various noisy channels. It was not until the '90s that graph-based codes, such as ...

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Arikan proved that this class of codes, ...

Extending Peer-to-Peer Networks for Approximate Search

Chat with Graph Search

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

Analysis of the influence of errors in DNA-based image coding

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

HolA: Holistic and Autonomous Attestation for IoT Networks

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

Enhancing the Reliability of Dense LoRaWAN Networks With Multi-User Receivers

On the Universality of Low-Density Parity-Check Block Codes

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

On the Computational Complexity of Blind Detection of Binary Linear Codes

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel

Adaptive simulation-based framework for error characterization of inexact circuits

Body-machine interfaces for non-homologous human-machine interactions

The Velocity of the Propagating Wave for Spatially Coupled Systems With Applications to LDPC Codes

Design rules for optimizing unipolar coded Brillouin optical time-domain analyzers

The Stability Condition of LDPC Codes Under MAP Decoding

Learning Externally Modulated Dynamical Systems

The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion

Analysis of Spatially Coupled Systems using the Potential Functional with Applications to Coding Theory

Re-proving Channel Polarization Theorems : An Extremality and Robustness Analysis