Class of constructive asymptotically good algebraic codes
From MaRDI portal
Publication:5671907
DOI10.1109/TIT.1972.1054893zbMath0256.94008MaRDI QIDQ5671907
Publication date: 1972
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Quantum bit-commitment for small storage based on quantum one-way permutations, Generating quasi-random sequences from semi-random sources, The complexity of error-correcting codes, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, One way functions and pseudorandom generators, Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Polynomial Data Structure Lower Bounds in the Group Model, Algebraic theory of block codes detecting independent errors, Unnamed Item, A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy, QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS, Constructions of permutation arrays for certain scheduling cost measures, Revisiting time-space tradeoffs for function inversion, Weighted Reed–Solomon convolutional codes, Unnamed Item, One-time programs from commodity hardware, Sphere packings constructed from BCH and Justesen codes, Code-Based Cryptosystems Using Generalized Concatenated Codes, Unnamed Item, Improved Extractors for Recognizable and Algebraic Sources, CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN, Non-malleable coding against bit-wise and split-state tampering, Computing in fault tolerant broadcast networks and noisy decision trees, Reusable fuzzy extractors for low-entropy distributions, Large groups, property (τ) and the homology growth of subgroups, Hardness magnification near state-of-the-art lower bounds, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, Fast Interactive Coding against Adversarial Noise, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Asymptotically good codes from generalized algebraic-geometry codes, On the decisional complexity of problems over the reals, Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity, Noisy beeping networks, Bit commitment using pseudorandomness
