Pages that link to "Item:Q3484767"

The following pages link to The hardness of decoding linear codes with preprocessing (Q3484767):

Displaying 23 items.

• On the ideal associated to a linear code (Q326292) (← links)
• Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
• An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
• A commutative algebra approach to linear codes (Q1024390) (← links)
• Fault-detection in networks (Q1199624) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
• The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
• Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
• Minimal linear codes arising from blocking sets (Q2025113) (← links)
• An inductive construction of minimal codes (Q2119851) (← links)
• Minimal linear codes constructed from functions (Q2154886) (← links)
• Maximal intersection queries in randomized input models (Q2268345) (← links)
• On the weight distribution of some minimal codes (Q2657132) (← links)
• On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
• On a Gröbner bases structure associated to linear codes (Q3637823) (← links)
• Weighted counting of solutions to sparse systems of equations (Q5222549) (← links)
• Computing coset leaders and leader codewords of binary codes (Q5255749) (← links)
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces (Q6112222) (← links)
• Minimal linear codes constructed from partial spreads (Q6571309) (← links)
• Minimal linear codes constructed from hierarchical posets with two levels (Q6646802) (← links)
• Designing quantum circuits for decoding binary linear codes (Q6663885) (← links)