The hardness of decoding linear codes with preprocessing
From MaRDI portal
Publication:3484767
DOI10.1109/18.52484zbMath0704.94022OpenAlexW2171712712MaRDI QIDQ3484767
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90b
Related Items
An inductive construction of minimal codes ⋮ The inapproximability of lattice and coding problems with preprocessing ⋮ On the ideal associated to a linear code ⋮ The hardness of approximate optima in lattices, codes, and systems of linear equations ⋮ Minimal linear codes constructed from functions ⋮ Decoding of Reed Solomon codes beyond the error-correction bound ⋮ On the weight distribution of some minimal codes ⋮ Minimal codewords arising from the incidence of points and hyperplanes in projective spaces ⋮ On the equivalence of two post-quantum cryptographic families ⋮ Hardness of approximating the closest vector problem with pre-processing ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm ⋮ Fault-detection in networks ⋮ Maximal intersection queries in randomized input models ⋮ Minimal linear codes arising from blocking sets ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Weighted counting of solutions to sparse systems of equations ⋮ On a Gröbner bases structure associated to linear codes ⋮ A commutative algebra approach to linear codes ⋮ Computing coset leaders and leader codewords of binary codes
