An exhaustion bound for algebraic-geometric ``modular codes
We contruct a new lower bound for asymptotic parameters of codes arising from modular curves. For \(q=4\), 9, 16, 25, it is identical to tn language for regular VLSI layouts. This language is a network calculus able to deal with recursive equations. These recursive equations can be understood as graph grammars. The solution of recursive system of equations can be obtained by the iteration of a homomorphism of the net algebra. In a certain sense, the class of the layouts defined by a system of equations can also be understood as Lindenmayer-Rozenberg-system.
- On improved asymptotic bounds for codes from global function fields
- Multiplicative lattices in global fields
- Algebraic-geometric codes and asymptotic problems
- Asymptotic properties of zeta-functions
- Further improvements on asymptotic bounds for codes using distinguished divisors
- scientific article; zbMATH DE number 4047616 (Why is no real title available?)
- On the number of effective divisors in algebraic function fields defined over a finite field
- Linear codes with exponentially many light vectors
This page was built for publication: An exhaustion bound for algebraic-geometric ``modular codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101412)
