Pages that link to "Item:Q3129458"

The following pages link to Linear-time encodable and decodable error-correcting codes (Q3129458):

Displaying 42 items.

• On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
• Combinatorial PCPs with efficient verifiers (Q483706) (← links)
• On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
• Eigenvalues and expansion of bipartite graphs (Q690667) (← links)
• Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation (Q893648) (← links)
• Parity check matrices and product representations of squares (Q949791) (← links)
• Fast approximate probabilistically checkable proofs (Q1881217) (← links)
• Achievable complexity-performance tradeoffs in lossy compression (Q1945149) (← links)
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
• Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• Toward a spectral theory of cellular sheaves (Q2304007) (← links)
• Local correctability of expander codes (Q2347805) (← links)
• Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
• Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
• Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
• Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
• Efficient Probabilistically Checkable Debates (Q3088122) (← links)
• Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
• (Q3305358) (← links)
• Arguments of Proximity (Q3457077) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Tensor Products of Weakly Smooth Codes Are Robust (Q3541803) (← links)
• (Q4568110) (← links)
• (Q5028364) (← links)
• The complexity of error-correcting codes (Q5055921) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
• Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
• Efficient Error-Correcting Codes for Sliding Windows (Q5220468) (← links)
• Fast Interactive Coding against Adversarial Noise (Q5501938) (← links)
• Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
• Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
• Codes on graphs: Recent progress (Q5951414) (← links)
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
• Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding (Q6137610) (← links)
• Efficient Linear and Affine Codes for Correcting Insertions/Deletions (Q6156613) (← links)
• Forty years of frequent items (Q6198649) (← links)
• Constructions of strongly regular Cayley graphs derived from weakly regular bent functions (Q6204333) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)