An exhaustion bound for algebraic-geometric ``modular'' codes (Q1101412): Difference between revisions

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.