An exhaustion bound for algebraic-geometric ``modular'' codes (Q1101412): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q920924 |
Changed an Item |
||
Property / author | |||
Property / author: S. G. Vleduts / rank | |||
Normal rank |
Revision as of 17:06, 21 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exhaustion bound for algebraic-geometric ``modular'' codes |
scientific article |
Statements
An exhaustion bound for algebraic-geometric ``modular'' codes (English)
0 references
1987
0 references
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.
0 references
lower bound for asymptotic parameters of codes
0 references
modular curves
0 references
network calculus
0 references
recursive equations
0 references
graph grammars
0 references
Lindenmayer-Rozenberg- system
0 references