Decoding balanced linear codes with preprocessing
From MaRDI portal
Cites work
- A statistical decoding algorithm for general linear block codes
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Asymptotics and improvements of sieving for codes
- Collision resistant hashing from sub-exponential learning parity with noise
- Constructing small-bias sets from algebraic-geometric codes
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Cryptographic primitives based on hard learning problems
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Dot-product proofs and their applications
- Explicit, almost optimal, epsilon-balanced codes
- Generalized Alon--Boppana Theorems and Error-Correcting Codes
- Grover vs. McEliece
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 2119705 (Why is no real title available?)
- Improved Inapproximability of Lattice and Coding Problems With Preprocessing
- Lattice problems in NP ∩ coNP
- Low-complexity cryptographic hash functions
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- More on average case vs approximation complexity
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On Bounded Distance Decoding for General Lattices
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the limits of nonapproximability of lattice problems
- Problems and results in extremal combinatorics. I.
- Quantum information set decoding algorithms
- Reduction from sparse LPN to LPN, dual attack 3.0
- SETH-hardness of coding problems
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Statistical decoding 2.0: reducing decoding to LPN
- Statistical Decoding Revisited
- Statistically sender-private OT from LPN and derandomization
- The inapproximability of lattice and coding problems with preprocessing
- Topics and Techniques in Distribution Testing: A Biased but Representative Sample
- Worst and average case hardness of decoding via smoothing bounds
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
This page was built for publication: Decoding balanced linear codes with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445536)