No label defined (Q3975181)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 17837
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 17837

      Statements

      26 June 1992
      0 references
      categorial isomorphism
      0 references
      completely regular codes
      0 references
      distance regular graph
      0 references
      binary code
      0 references
      Hamming distance
      0 references
      Golay codes
      0 references
      diameter
      0 references
      valency
      0 references
      propelinear structure
      0 references
      0 references
      [For the entire collection see Zbl 0727.00017.] A functorial isomorphism is presented between the category \({\mathfrak G}\) of \(e\)-latticed, distance regular graphs and the category \({\mathfrak C}\) of completely regular binary propelinear codes. Using this isomorphism the non-existence properties of certain types of graphs are shown. Further, it is proved that the linear structure is the only propelinear structure in Golay codes \(G_{23}\) and \(G_{24}\). Uniqueness is deduced of certain types of graphs given by their parameters. Let \(G=(V,E)\) be a connected undirected graph without loops; denote by \(d(x,y)\) the distance between vertices \(x,y\in V\), and by \(\rho\) the diameter of \(G\). The graph \(G\) is called distance regular if for every \(i,j,k\in\{0,\ldots,\rho\}\) there exists a number \(p_{kij}\) such that, for every \(x,y\in V\) with \(d(x,y)=k\), the number of vertices \(z\) with \(d(x,z)=i\) and \(d(z,y)=j\) equals \(p_{kij}\). The number \(p_{011}\) is called the valency of \(G\). A distance regular graph of the valency \(n\) is \(e\)-latticed if moreover the numbers \(p_{kij}\) satisfy \(p_{i1j}=n-i\) for \(0\leq i=j-1\leq e-1\), \(p_{i1i}=0\), and \(p_{i1j}=i\) for \(0\leq i=j+1\leq e\). The category \({\mathfrak G}\) is formed by all \(e\)-latticed, distance regular graphs with one fixed vertex \(a\), together with all compatible mappings preserving the fixed points that are isomorphisms on the complete subgraphs generated by the set of vertices of distance 1 from \(a\). Let \(C\) be a binary code (i.e. \(C\subseteq F^ n\) for \(F={\mathfrak Z}/2)\). By the distance the Hamming distance is meant. The error-correcting capability \(e\) of \(C\) is \(\left\lfloor{d-1\over 2}\right\rfloor\) where \(d\) is the maximal distance between two elements of \(C\). Denote by \(\rho(v)\) the distance of a \(v\in F^ n\) from \(C\) and by \(B(v,p)\) the number of \(c\in C\) for which \(d(c,v)=p\). An \(e\)-correcting code \(C\) is completely regular if for every \(n,p\) there exists a number \(b_{np}\) such that \(B(v,p)=b_{np}\) whenever \(\rho(v)=n\). A binary code \(C\) with \(0\in C\) is propelinear if for every \(v\in C\) there is an isometry \(\pi_ v:F^ n\to F^ n\) such that (1) \(v+\pi_ v(s)\in C\) iff \(s\in C\), and (2) for every \(w\in C\), \(\pi_ v\circ\pi_ w=\pi_ m\), where \(m=v+\pi_ v(w)\). Moreover, the operation \(*\) defined by \(x*y=x+\pi_ x(y)\) for \(x\in C\), \(y\in F^ n\) is called the propelinear structure of \(C\). The category \({\mathfrak C}\) consists of all completely regular binary propelinear codes, together with all morphisms which are those restrictions of isometries of \(F^ n\) that preserves the propelinear structures.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references