On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs. Rifà-Coma, J. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24, 1990, Proceedings, volume 508, of Lecture Notes in Computer Science, pages 164–179, 1990. Springer.
On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/aaecc/Rifa-Coma90,
  author    = {Josep Rif{\`{a}}{-}Coma},
  editor    = {Shojiro Sakata},
  title     = {On a Categorial Isomorphism between a Class of Completely Regular
               Codes and a Class of Distance Regular Graphs},
  booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
               8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24,
               1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {508},
  pages     = {164--179},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-54195-0\_49},
  doi       = {10.1007/3-540-54195-0\_49},
  timestamp = {Tue, 14 May 2019 10:00:39 +0200},
  biburl    = {https://dblp.org/rec/conf/aaecc/Rifa-Coma90.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0