Concept

Hamming code

Related publications (226)

About
Privacy
Disclaimer

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.

Hamming code

Graph Chatbot

Chat with Graph Search

Usage of Hints on Coding-Based Summative Assessments

The Stability Condition of LDPC Codes Under MAP Decoding

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

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Evidence of a structure in (K)over-bar(0)Lambda(+)(c) consistent with a charged Xi(c)(2930)(+), and updated measurement of (B)over-bar(0) -> (K)over-bar(0)Lambda(+)(c) (Lambda)over-bar(c)(-) at Belle

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

Rake, Peel, Sketch

A feasible-side globally convergent modifier-adaptation scheme

A 64-Gb/s 1.4-pJ/b NRZ Optical Receiver Data-Path in 14-nm CMOS FinFET