Publications associées à Distance de Hamming

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

IEEE2018

Optimal Computational Split-state Non-malleable Codes

Divesh Aggarwal, Divya Gupta

Non-malleable codes are a generalization of classical error-correcting codes where the act of "corrupting" a codeword is replaced by a "tampering" adversary. Non-malleable codes guarantee that the message contained in the tampered codeword is either the or ...

Springer Int Publishing Ag2016

Do We Need Binary Features for 3D Reconstruction?

Pascal Fua, Xinchao Wang, Zhiye Wang, Bin Fan

Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time application ...

2016

Scaling Exponent of List Decoders With Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff betwe ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Budgeted sensor placement for source localization on trees

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

2015

Integer-forcing Linear Receivers

Michael Christoph Gastpar

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be ...

Institute of Electrical and Electronics Engineers2014

Adaptive Penalty-Based Distributed Stochastic Convex Optimization

Ali H. Sayed

In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a fully distributed ...

Institute of Electrical and Electronics Engineers2014

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Distance de Hamming

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Optimal Computational Split-state Non-malleable Codes

Revisiting the Sanders-Bogolyubov-Ruzsa Theorem in F-p(n) and its Application to Non-malleable Codes

Do We Need Binary Features for 3D Reconstruction?

Mechanical Stability Margin for Scouting Poses in Modular Snake Robots

Scaling Exponent of List Decoders With Applications to Polar Codes

Budgeted sensor placement for source localization on trees

Integer-forcing Linear Receivers

Adaptive Penalty-Based Distributed Stochastic Convex Optimization

Scaling Exponent of List Decoders with Applications to Polar Codes

Graph Chatbot

Chattez avec Graph Search

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Optimal Computational Split-state Non-malleable Codes

Adaptive Penalty-Based Distributed Stochastic Convex Optimization

Revisiting the Sanders-Bogolyubov-Ruzsa Theorem in F-p(n) and its Application to Non-malleable Codes

Mechanical Stability Margin for Scouting Poses in Modular Snake Robots

Do We Need Binary Features for 3D Reconstruction?

Integer-forcing Linear Receivers

Scaling Exponent of List Decoders With Applications to Polar Codes

Budgeted sensor placement for source localization on trees

Scaling Exponent of List Decoders with Applications to Polar Codes