Class of constructive asymptotically good algebraic codes
From MaRDI portal
Cited in
(45)- Generating quasi-random sequences from semi-random sources
- One way functions and pseudorandom generators
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Algebraic theory of block codes detecting independent errors
- On the decisional complexity of problems over the reals
- Quantum bit-commitment for small storage based on quantum one-way permutations
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
- Reusable fuzzy extractors for low-entropy distributions
- Noisy beeping networks
- Asymptotically good codes from generalized algebraic-geometry codes
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Computing in fault tolerant broadcast networks and noisy decision trees
- On the complexity of closest pair via polar-pair of point-sets
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- Large groups, property (τ) and the homology growth of subgroups
- Constructions of permutation arrays for certain scheduling cost measures
- Code-based cryptosystems using generalized concatenated codes
- Algorithms for noisy broadcast with erasures
- Hardness magnification near state-of-the-art lower bounds
- The complexity of error-correcting codes
- Polynomial data structure lower bounds in the group model
- Hardness magnification near state-of-the-art lower bounds
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy
- On the complexity of closest pair via polar-pair of point-sets
- Fast interactive coding against adversarial noise
- Sphere packings constructed from BCH and Justesen codes
- Relaxed locally correctable codes
- Improved Extractors for Recognizable and Algebraic Sources
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
- Revisiting time-space tradeoffs for function inversion
- Weighted Reed–Solomon convolutional codes
- One-time programs from commodity hardware
- Nearly optimal pseudorandomness from hardness
- Strong blocking sets and minimal codes from expander graphs
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions
- Lossy cryptography from code-based assumptions
- Locally recoverable algebro-geometric codes from projective bundles
- Density estimation using the perceptron
- When do low-rate concatenated codes approach the Gilbert-Varshamov bound?
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Expander graphs, strong blocking sets and minimal codes (extended abstract)
- Local proofs approaching the witness length
- Error-correcting graph codes
- Near-optimal averaging samplers and matrix samplers
- Bit commitment using pseudorandomness
This page was built for publication: Class of constructive asymptotically good algebraic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671907)
