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):
Displayed 12 items.
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis (Q733507) (← 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)
- 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)
- 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)