Pages that link to "Item:Q1890046"
From MaRDI portal
The following pages link to Bounding the trellis state complexity of algebraic geometric codes (Q1890046):
Displaying 4 items.
- Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve (Q514528) (← links)
- Determining when the absolute state complexity of a Hermitian code achieves its DLP bound (Q2784499) (← links)
- Algebraic Geometry Codes from Castle Curves (Q3540927) (← links)
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes (Q4679952) (← links)