scientific article; zbMATH DE number 5300021
From MaRDI portal
Publication:3511983
Recommendations
- scientific article; zbMATH DE number 5557994
- Discriminating codes in bipartite graphs
- Codes based on complete graphs
- Some combinatorial aspects of constructing bipartite-graph codes
- Constructions of binary codes based on bipartite graphs
- scientific article; zbMATH DE number 975345
- Codings of graphs with binary edge labels
- scientific article; zbMATH DE number 1803166
- Discriminating codes in (bipartite) planar graphs
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
Cited in
(15)- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Degree and regularity of Eulerian ideals of hypergraphs
- Joins, ears and Castelnuovo-Mumford regularity
- Regularity of the vanishing ideal over a parallel composition of paths
- Direct products in projective Segre codes
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Minimum distance of some evaluation codes
- Vanishing ideals over complete multipartite graphs
- The minimum distance of parameterized codes on projective tori
- Parameterized codes over graphs
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- The minimum distance of a parameterized code over an even cycle
- Codes parameterized by the edges of a bipartite graph with a perfect matching
- Parameterized codes associated to the edges of some subgraphs of a simple graph
- Generalized Hamming weights and some parameterized codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511983)
