An exhaustion bound for algebraic-geometric ``modular codes
From MaRDI portal
Publication:1101412
zbMath0642.94030MaRDI QIDQ1101412
Publication date: 1987
Published in: Problems of Information Transmission (Search for Journal in Brave)
modular curvesgraph grammarsnetwork calculusrecursive equationsLindenmayer-Rozenberg- systemlower bound for asymptotic parameters of codes
Related Items (7)
On the number of effective divisors in algebraic function fields defined over a finite field ⋮ Further improvements on asymptotic bounds for codes using distinguished divisors ⋮ Multiplicative lattices in global fields ⋮ Algebraic-geometric codes and asymptotic problems ⋮ Linear codes with exponentially many light vectors ⋮ Asymptotic properties of zeta-functions ⋮ On improved asymptotic bounds for codes from global function fields
This page was built for publication: An exhaustion bound for algebraic-geometric ``modular codes
