Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
From MaRDI portal
Publication:3547802
Recommendations
- Excellent Nonlinear Codes From Algebraic Function Fields
- Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound
- A Note on Further Improvements of the TVZ-Bound
- Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing bounds
- Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
Cited in
(12)- Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound
- A Note on Further Improvements of the TVZ-Bound
- Excellent Nonlinear Codes From Algebraic Function Fields
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing bounds
- High-rate codes with sublinear-time decoding
- On improved asymptotic bounds for codes from global function fields
- On the locality of codeword symbols in non-linear codes
- Deterministic construction of compressed sensing matrices from codes
- On Singleton-type bound of locally repairable codes
- Further improvements on asymptotic bounds for codes using distinguished divisors
- Deterministic constructions of compressed sensing matrices based on codes
This page was built for publication: Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547802)