Concept
Linear code
Related publications (207)
Pipelined Architecture for Soft-Decision Iterative Projection Aggregation Decoding for RM Codes
Alexios Konstantinos Balatsoukas Stimming, Yuqing Ren
The recently proposed recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller codes has received significant attention as it provides near-ML decoding performance at reasonable complexity for short codes. However, its complicated structur ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023A Gapless Post-quantum Hash Proof System in the Hamming Metric
Serge Vaudenay, Bénédikt Minh Dang Tran
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 ...
2023Scalable Metaprogramming in Scala 3
A metaprogrammer should be able to reason about the semantics of the generated code.Multi-stage programming introduced an elegant and powerful solution to this problem.It follows a semantically driven approach to code generation, where semantics are fully ...
EPFL2023Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022Optima Age Over Erasure Channels
Emre Telatar, Elie Najm, Rajai Nasser
Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022On the Efficiency of Polar-Like Decoding for Symmetric Codes
Rüdiger Urbanke, Kirill Ivanov
The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...
2022An element-based formulation for ES-FEM and FS-FEM models for implementation in standard solid mechanics finite element codes for 2D and 3D static analysis
Edge-based and face-based smoothed finite element methods (ES-FEM and FS-FEM, respectively) are modified versions of the finite element method allowing to achieve more accurate results and to reduce sensitivity to mesh distortion, at least for linear eleme ...
WILEY2022On Codes Decoding a Constant Fraction of Errors on the BSC
We strengthen the results from a recent work by the second author, achieving bounds on the weight distribution of binary linear codes that are successful under block-MAP (as well as bit-MAP) decoding on the BEC. We conclude that a linear code that is succe ...
ASSOC COMPUTING MACHINERY2021Almost impossible E_8 and Leech lattices
We start this short note by introducing two remarkable mathematical objects: the E8E8 root lattice Lambda8Lambda8 in 8-dimensional Euclidean space and the Leech lattice Lambda24Lambda24 in 24-dimensional space. These two lattices stand out among their lat ...
2021