Goppa geometric codes achieving the Gilbert-Varshamov bound
From MaRDI portal
Publication:3547804
DOI10.1109/TIT.2004.838351zbMATH Open1303.94141MaRDI QIDQ3547804FDOQ3547804
Authors: Chaoping Xing
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1426184
- GENERALIZED GEOMETRIC GOPPA CODES
- Goppa codes that are better than the Varshamov-Gilbert bound
- scientific article; zbMATH DE number 3793939
- Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
- Geometric constructions of Gallager codes
- On the weight hierarchy of geometric Goppa codes
- Improved geometric Goppa codes. I. Basic theory
- Geometric Goppa codes on Fermat curves
- Publication:4892618
Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (6)
- A generalized floor bound for the minimum distance of geometric Goppa codes
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes
- When are two geometric Goppa codes equal?
- Title not available (Why is that?)
- Construction of improved geometric Goppa codes from Klein curves and Klein-like curves
- Sudan-decoding generalized geometric Goppa codes.
This page was built for publication: Goppa geometric codes achieving the Gilbert-Varshamov bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547804)