Pages that link to "Item:Q4544665"
From MaRDI portal
The following pages link to A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (Q4544665):
Displaying 22 items.
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis (Q733507) (← links)
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes (Q849367) (← links)
- On the \(q\)th power algorithm (Q958619) (← links)
- Integral closures and weight functions over finite fields. (Q1414024) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- Bounding the trellis state complexity of algebraic geometric codes (Q1890046) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- On rational embeddings of curves in the second Garcia-Stichtenoth tower (Q2426473) (← links)
- Spaces of modular forms and algebraic geometric codes (Q2907095) (← links)
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes (Q4679952) (← links)
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes (Q4701109) (← links)
- ON ASYMPTOTICALLY OPTIMAL TOWERS OVER QUADRATIC FIELDS RELATED TO GAUSS HYPERGEOMETRIC FUNCTIONS (Q4929862) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower (Q5386100) (← links)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets (Q5429508) (← links)
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions (Q6156613) (← links)
- Construction-D lattice from Garcia–Stichtenoth tower code (Q6499093) (← links)
- Deterministic document exchange protocols and almost optimal binary codes for edit errors (Q6551260) (← links)
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions (Q6571302) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Combinatorial constructions of separating codes (Q6649717) (← links)
- Finer-grained reductions in fine-grained hardness of approximation (Q6658294) (← links)