Publications related to Hamming distance

A Gapless Post-quantum Hash Proof System in the Hamming Metric

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Chuan Zhang

Since polar were ratified as part of the 5G standard, low-complexity polar decoders with close-to-optimum error-rate performance have received significant attention. Compared to successive cancellation (SC) decoding, both SC list and SC flip decoding can i ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Towards Single Photon Detection with Amorphous Silicon Based Microchannel Plates

Janina Christine Isabelle Löffler

An exciting new approach for microchannel plate (MCP) detectors could help make them suitable for single photon detection. State-of-the-art clean room technology allows amorphous silicon based microchannel plates (AMCPs) to take a variety of shapes. This v ...

EPFL2021

On-the-Fly ab initio Semiclassical Evaluation of Electronic Coherences in Polyatomic Molecules Reveals a Simple Mechanism of Decoherence

Jiri Vanicek, Tomislav Begusic, Nikolay Golubev

Irradiation of a molecular system by an intense laser field can trigger dynamics of both electronic and nuclear subsystems. The lighter electrons usually move on much faster, attosecond timescale but the slow nuclear rearrangement damps ultrafast electroni ...

2020

Adaptive simulation-based framework for error characterization of inexact circuits

Vincent Frédéric Camus

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

PERGAMON-ELSEVIER SCIENCE LTD2019

On the Computational Complexity of Blind Detection of Binary Linear Codes

Alexios Konstantinos Balatsoukas Stimming, Aris Filos Ratsikas

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

IEEE2019

Compute–Forward Multiple Access (CFMA): Practical Implementations

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

2019

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

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.

Hamming distance

A Gapless Post-quantum Hash Proof System in the Hamming Metric

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

Almost impossible E_8 and Leech lattices

Towards Single Photon Detection with Amorphous Silicon Based Microchannel Plates

On-the-Fly ab initio Semiclassical Evaluation of Electronic Coherences in Polyatomic Molecules Reveals a Simple Mechanism of Decoherence

New Results On The Pseudoredundancy

Adaptive simulation-based framework for error characterization of inexact circuits

On the Computational Complexity of Blind Detection of Binary Linear Codes

Compute–Forward Multiple Access (CFMA): Practical Implementations

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

Graph Chatbot

Chat with Graph Search

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

Almost impossible E_8 and Leech lattices

On-the-Fly ab initio Semiclassical Evaluation of Electronic Coherences in Polyatomic Molecules Reveals a Simple Mechanism of Decoherence

Compute–Forward Multiple Access (CFMA): Practical Implementations

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

Towards Single Photon Detection with Amorphous Silicon Based Microchannel Plates

New Results On The Pseudoredundancy

Adaptive simulation-based framework for error characterization of inexact circuits

A Gapless Post-quantum Hash Proof System in the Hamming Metric

On the Computational Complexity of Blind Detection of Binary Linear Codes