scientific article; zbMATH DE number 975345
From MaRDI portal
Publication:5284014
zbMATH Open0860.94027MaRDI QIDQ5284014FDOQ5284014
Authors: Carlos Rentería Márquez, Horacio Tapia-Recillas 
Publication date: 28 April 1997
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05)
Cited In (17)
- An application of coding theory to a problem in graphical enumeration
- Title not available (Why is that?)
- Tensors, matchings and codes
- Geometric representations of binary codes and computation of weight enumerators
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- Constructions of binary codes based on bipartite graphs
- Vertex codes of graphs
- Title not available (Why is that?)
- Topological code of graphs
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- Title not available (Why is that?)
- On the dimension of a class of graph codes on algebraically defined graphs with Reed-Solomon component codes
- Binary code properties of perfect matching in hexagonal graph
- Minimal Graphs with a Specified Code Map Image
- Directed circulant graphs and binary cyclic codes
- Equivalent circulant graphs associated with a binary cyclic code
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 Q5284014)
