Linear-time encodable and decodable error-correcting codes
From MaRDI portal
Publication:3129458
DOI10.1109/18.556668zbMath0943.94544OpenAlexW2135393523MaRDI QIDQ3129458
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
Related Items
On encoding symbol degrees of array BP-XOR codes, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Fast approximate probabilistically checkable proofs, The complexity of error-correcting codes, Unnamed Item, Binary AMD Circuits from Secure Multiparty Computation, Arguments of Proximity, Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization, Using low-density parity-check codes to improve the McEliece cryptosystem, Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier, Linear-size constant-query IOPs for delegating computation, Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation, Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error, Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding, Brakedown: linear-time and field-agnostic SNARKs for R1CS, Faster sounder succinct arguments and \textsf{IOP}s, Efficient Linear and Affine Codes for Correcting Insertions/Deletions, Orion: zero knowledge proof with linear prover time, Achievable complexity-performance tradeoffs in lossy compression, Expander graphs and their applications, Forty years of frequent items, Constructions of strongly regular Cayley graphs derived from weakly regular bent functions, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms, PCPs and the hardness of generating synthetic data, Unnamed Item, Tensor Products of Weakly Smooth Codes Are Robust, Combinatorial PCPs with efficient verifiers, Efficient Error-Correcting Codes for Sliding Windows, On metric properties of maps between Hamming spaces and related graph homomorphisms, Parity check matrices and product representations of squares, Eigenvalues and expansion of bipartite graphs, Codes on graphs: Recent progress, Unnamed Item, Computational sample complexity and attribute-efficient learning, Toward a spectral theory of cellular sheaves, Efficient Probabilistically Checkable Debates, Hardness magnification near state-of-the-art lower bounds, Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity, Rate-1, Linear Time and Additively Homomorphic UC Commitments, Breaking the Circuit Size Barrier for Secure Computation Under DDH, Fast Interactive Coding against Adversarial Noise, Efficient Construction of Rigid Matrices Using an NP Oracle, Local correctability of expander codes
