Algebraic-geometric codes and asymptotic problems
Asymptotic bounds of coding theory are summarized and analyzed. For an \((n,k,d)_ q\) linear code let \(R=k/n\), \(\delta=d/n\), the relations between the possible limit values of \(\delta\) and \(R\) when \(n,k\) and \(d\) tend to infinity are considered. Let \(V_ q\) be the set of \((\delta,R)\) pairs for all possible \(q\)-ary codes and \(U_ q\) the set of its limit points. Similar quantities can be described for the set of linear codes and the set of codes that can be constructed with complexity polynomial in their length. The classical upper and lower bounds are considered along with more recent ones. Certain aspects of codes from algebraic geometries are surveyed as well as bounds specific to such codes. Some relationships between the various bounds are considered with tables given for the cases of \(q=2\) and 49.
- A note on lower bounds (Corresp.)
- An exhaustion bound for algebraic-geometric ``modular codes
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- Goppa codes that are better than the Varshamov-Gilbert bound
- scientific article; zbMATH DE number 3836211 (Why is no real title available?)
- scientific article; zbMATH DE number 3855273 (Why is no real title available?)
- scientific article; zbMATH DE number 4156636 (Why is no real title available?)
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 4037764 (Why is no real title available?)
- scientific article; zbMATH DE number 4047601 (Why is no real title available?)
- scientific article; zbMATH DE number 4104859 (Why is no real title available?)
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 3803619 (Why is no real title available?)
- Linear codes and modular curves
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
- Number of points of an algebraic curve
- On the decoding of algebraic-geometric codes
- Selbstduale Goppa-Codes
- Constructions and bounds on linear error-block codes
- On improved asymptotic bounds for codes from global function fields
- An exhaustion bound for algebraic-geometric ``modular codes
- Asymptotic properties of zeta-functions
- Frameproof codes against limited coalitions of pirates
- Intersecting codes and separating codes
- Yet another variation on minimal linear codes
- Intersecting codes and partially identifying codes
- On group structures realized by elliptic curves over a fixed finite field
- A computability challenge: asymptotic bounds for error-correcting codes
- The asymptotic theory of algebraic-geometry codes
- On codes over \(\mathrm{FFN}(1,q)\)-projective varieties
- Some Maximal Function Fields and Additive Polynomials
- scientific article; zbMATH DE number 4164733 (Why is no real title available?)
- Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
- Asymptotic bounds on quantum codes from algebraic geometry codes
- Bounds for codes over the unit circle
- scientific article; zbMATH DE number 4037764 (Why is no real title available?)
- scientific article; zbMATH DE number 4104859 (Why is no real title available?)
- scientific article; zbMATH DE number 1284417 (Why is no real title available?)
- scientific article; zbMATH DE number 1077413 (Why is no real title available?)
- Curves of large genus covered by the hermitian curve
- Good codes based on very sparse matrices
- scientific article; zbMATH DE number 774615 (Why is no real title available?)
- A method of constructing linear mapping families to achieve the asymptotic GV bound
- A note on optimal towers over finite fields
This page was built for publication: Algebraic-geometric codes and asymptotic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180622)
