Reed-Muller codes on complete intersections.
From MaRDI portal
Recommendations
Cited in
(55)- Linkage and codes on complete intersections
- Toric codes and lattice ideals
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Complete intersection vanishing ideals on sets of clutter type over finite fields
- Cayley-Bacharach and evaluation codes on complete intersections
- Codes from flag varieties over a finite field
- Reed-Muller-type codes over the Segre variety
- Generalized minimum distance functions
- Codes over a weighted torus
- On dual toric complete intersection codes
- The dual of an evaluation code
- On intersections of Reed-Muller like codes
- Evaluation codes and their basic parameters
- Skeleton simplicial evaluation codes
- Generalized Hamming weights of projective Reed-Muller-type codes over graphs
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Projective Reed-Muller type codes on higher dimensional scrolls
- Projective nested Cartesian codes
- The Horace method for error-correcting codes
- Affine Cartesian codes
- Computing the degree of a lattice ideal of dimension one
- Direct products in projective Segre codes
- Dual codes of some types of Reed-Muller codes
- The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
- Complete intersections in binomial and lattice ideals
- Multigraded Hilbert functions and toric complete intersection codes
- Evaluation codes over a particular complete intersection
- On the vanishing ideal of an algebraic toric set and its parametrized linear codes
- Cummutative algebra and evaluation codes
- Reed‐muller codes: an ideal theory approach
- Complete intersections in projective space and small weight codewords of duals of algebro-geometric codes
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Complete intersection vanishing ideals on degenerate tori over finite fields
- Minimum distance of some evaluation codes
- Vanishing ideals over complete multipartite graphs
- The minimum distance of parameterized codes on projective tori
- Minimum distance functions of complete intersections
- Regularity and algebraic properties of certain lattice ideals
- Linear codes associated to the ideal of points in PdAnd its canonical module
- Lattice ideals, semigroups and toric codes
- Vanishing Ideals Over Graphs and Even Cycles
- Uniformity for geometric codes over large extensions of \(\mathbb F_q\)
- On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
- Relative generalized Hamming weights of evaluation codes
- Parameterized codes over graphs
- Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- The minimum distance of a parameterized code over an even cycle
- Codes parameterized by the edges of a bipartite graph with a perfect matching
- Asymptotic behaviour of the v-number of homogeneous ideals
- Testing isomorphism of Boolean functions over finite abelian groups
- Parameterized codes associated to the edges of some subgraphs of a simple graph
- Projective Reed-Muller type codes on rational normal scrolls
- Generalized Hamming weights and some parameterized codes
This page was built for publication: Reed-Muller codes on complete intersections.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941640)
