30 results
Search Results
2. Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves.
3. Constructions of Locally Recoverable Codes Which are Optimal.
4. Twisted Reed–Solomon Codes.
5. Towards the Complete Determination of Next-to-Minimal Weights of Projective Reed-Muller Codes.
6. Projective Reed–Muller type codes on higher dimensional scrolls.
7. Classical and Quantum Evaluation Codes at the Trace Roots.
8. Decreasing norm-trace codes.
9. Evaluation codes and their basic parameters
10. Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
11. Affine Cartesian codes with complementary duals.
12. Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed–Solomon codes
13. TORIC SURFACE CODES AND MINKOWSKI LENGTH OF POLYGONS.
14. Saturation and vanishing ideals
15. Relative generalized Hamming weights of evaluation codes
16. Projective Reed–Muller type codes on rational normal scrolls.
17. Toric complete intersection codes
18. Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
19. On puncturing of codes from Norm–Trace curves
20. Evaluation codes from smooth quadric surfaces and twisted Segre varieties
21. On codes from norm–trace curves
22. The dual of an evaluation code.
23. Lifted projective Reed–Solomon codes.
24. Near weights on higher dimensional varieties.
25. Affine cartesian codes.
26. COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS.
27. The minimum distance of parameterized codes on projective tori.
28. Lower bounds on minimal distance of evaluation codes
29. On algebras admitting a complete set of near weights, evaluation codes, and Goppa codes
30. Evaluation codes at singular points of algebraic differential equations
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.