Pages that link to "Item:Q862559"
From MaRDI portal
The following pages link to The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting (Q862559):
Displaying 10 items.
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes (Q507148) (← links)
- Weierstrass semigroup at \(m+1\) rational points in maximal curves which cannot be covered by the Hermitian curve (Q782854) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Redundancies of correction capability optimized Reed-Muller codes (Q1005243) (← links)
- On numerical semigroups and the redundancy of improved codes correcting generic errors (Q1035812) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Algebraic-geometry codes, one-point codes, and evaluation codes (Q2384021) (← links)
- NONHOMOGENEOUS PATTERNS ON NUMERICAL SEMIGROUPS (Q2854968) (← links)
- Generalizing strong admissibility of patterns of numerical semigroups (Q2973343) (← links)
