A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
From MaRDI portal
(Redirected from Publication:4544665)
Recommendations
- scientific article; zbMATH DE number 2154096
- Finding the defining functions for one-point algebraic-geometry codes
- Integral bases in a tower of algebraic function fields: a contribution to the construction of asymptotically good algebraic-geometric codes
- A tutorial on AG code construction from a Gröbner basis perspective
- scientific article; zbMATH DE number 1594280
- A sequence of one-point codes from a tower of function fields
- On evaluation codes coming from a tower of function fields
- An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound
- On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound
Cited in
(33)- Integral closures and weight functions over finite fields.
- A class of I.P.P. codes with efficient identification
- Bounding the trellis state complexity of algebraic geometric codes
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- On rational embeddings of curves in the second Garcia-Stichtenoth tower
- Spaces of modular forms and algebraic geometric codes
- An optimal unramified tower of function fields
- Codes From the Suzuki Function Field
- Finding the defining functions for one-point algebraic-geometry codes
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- On asymptotically optimal towers over quadratic fields related to Gauss hypergeometric functions
- Integral bases in a tower of algebraic function fields: a contribution to the construction of asymptotically good algebraic-geometric codes
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- The root diagram for one-point AG codes arising from certain curves with separated variables
- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Explicit towers and codes
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Construction-D lattice from Garcia–Stichtenoth tower code
- Outer strong blocking sets
- Deterministic document exchange protocols and almost optimal binary codes for edit errors
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Combinatorial constructions of separating codes
- Finer-grained reductions in fine-grained hardness of approximation
- Finer-grained reductions in fine-grained hardness of approximation
- On approximability of Steiner tree in _p-metrics
- Deterministic replacement path covering
- Weierstrass semigroups in an asymptotically optimal tower of function fields
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- On the \(q\)th power algorithm
This page was built for publication: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544665)
