Linear-time encodable and decodable error-correcting codes
From MaRDI portal
Publication:3129458
DOI10.1109/18.556668zbMATH Open0943.94544OpenAlexW2135393523MaRDI QIDQ3129458FDOQ3129458
Publication date: 12 June 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.556668
Recommendations
Cited In (51)
- Random walks on Cayley graphs of complex reflection groups
- PCPs and the hardness of generating synthetic data
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- Eigenvalues and expansion of bipartite graphs
- Codes on graphs: Recent progress
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- On encoding symbol degrees of array BP-XOR codes
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- The complexity of error-correcting codes
- On the minimum depth of circuits with linear number of wires encoding good codes
- Fast approximate probabilistically checkable proofs
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Linear time adaptive arithmetic coding
- Efficient Probabilistically Checkable Debates
- Efficient Construction of Rigid Matrices Using an NP Oracle
- Toward a spectral theory of cellular sheaves
- Orion: zero knowledge proof with linear prover time
- Faster sounder succinct arguments and \textsf{IOP}s
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Title not available (Why is that?)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation
- Local correctability of expander codes
- Forty years of frequent items
- Title not available (Why is that?)
- Tensor Products of Weakly Smooth Codes Are Robust
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Binary AMD Circuits from Secure Multiparty Computation
- Title not available (Why is that?)
- Linear-size constant-query IOPs for delegating computation
- Combinatorial PCPs with efficient verifiers
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Rigid matrices from rectangular PCPs
- Achievable complexity-performance tradeoffs in lossy compression
- Efficient Error-Correcting Codes for Sliding Windows
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
- Arguments of Proximity
- Expander graphs and their applications
- Field-agnostic SNARKs from expand-accumulate codes
- Linear time encodable and list decodable codes
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
- Hardness magnification near state-of-the-art lower bounds
- 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
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Fast Interactive Coding against Adversarial Noise
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
- 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)
