Linear-time encodable and decodable error-correcting codes
From MaRDI portal
Recommendations
Cited in
(70)- PCPs and the hardness of generating synthetic data
- Fast sketch-based recovery of correlation outliers
- Eigenvalues and expansion of bipartite graphs
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- Codes on graphs: Recent progress
- On encoding symbol degrees of array BP-XOR codes
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- The complexity of error-correcting codes
- A note on the decoding complexity of error-correcting codes
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Fast interactive coding against adversarial noise
- Rate-1, linear time and additively homomorphic UC commitments
- High-girth near-Ramanujan graphs with lossy vertex expansion
- Fast approximate probabilistically checkable proofs
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- On the minimum depth of circuits with linear number of wires encoding good codes
- Linear time adaptive arithmetic coding
- Efficient Probabilistically Checkable Debates
- Breaking the circuit size barrier for secure computation under DDH
- Binary AMD circuits from secure multiparty computation
- Toward a spectral theory of cellular sheaves
- Efficient Construction of Rigid Matrices Using an NP Oracle
- Arguments of proximity (extended abstract)
- Local proofs approaching the witness length
- Orion: zero knowledge proof with linear prover time
- Linear prover IOPs in log star rounds
- Linear-time accumulation schemes
- Efficient error-correcting codes for sliding windows
- Faster sounder succinct arguments and \textsf{IOP}s
- An efficient coding theorem via probabilistic representations and its applications
- Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation
- Local correctability of expander codes
- Hardness magnification near state-of-the-art lower bounds
- Tensor Products of Weakly Smooth Codes Are Robust
- Forty years of frequent items
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Explicit time and space efficient encoders exist only with random access
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Linear-size constant-query IOPs for delegating computation
- Combinatorial PCPs with efficient verifiers
- Linear-time decoding from a constant fraction of errors for irregular expander codes
- On the relaxed LDC of BGHSV: a survey that corrects the record
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Rigid matrices from rectangular PCPs
- Achievable complexity-performance tradeoffs in lossy compression
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
- Blaze: fast SNARKs from interleaved RAA codes
- Applications of random algebraic constructions to hardness of approximation
- Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols
- Expander graphs and their applications
- Linear time encodable and list decodable codes
- Towards stronger depth lower bounds
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
- Hardness magnification near state-of-the-art lower bounds
- Field-agnostic SNARKs from expand-accumulate codes
- Proving as fast as computing: succinct arguments with constant prover overhead
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- On metric properties of maps between Hamming spaces and related graph homomorphisms
- Random walks on Cayley graphs of complex reflection groups
- When can an expander code correct (n) errors in O(n) time?
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
- Explicit rateless codes for memoryless binary-input output-symmetric channels
- Efficient construction of rigid matrices using an NP oracle
- Parity check matrices and product representations of squares
- Computational sample complexity and attribute-efficient learning
This page was built for publication: Linear-time encodable and decodable error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129458)
