January 01, 2001 article A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound IEEE Transactions on Information Theory DOI: 10.1109/18.945244 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 112 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Asymptotically-Good Arithmetic Secret Sharing over $$\mathbb {Z}/p^{\ell }\mathbb {Z}$$ with Strong Multiplication and Its Applications to Efficient MPC 2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 26 citations On the Complexity of Arithmetic Secret Sharing 2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security 4 citations 2 results References 0