On Completely Regular Propelinear Codes
暂无分享，去创建一个
In a previous paper (see [7]) we found that given a distance regular e-latticed graph γ we can associate with it a completely regular code C. We used this in order to solve a conjecture given by Bannai in [1].
[1] Gwihen Etienne. Perfect Codes and Regular Partitions in Graphs and Groups , 1987, Eur. J. Comb..
[2] Josep Rifà,et al. Characterization of Completely Regular Codes through P-Polynomial Association Schemes , 1986, AAECC.
[3] D. G. Higman. Coherent configurations , 1975 .
[4] Josep Rifà i Coma. Equivalencies entre estructures combinatoricament regulars: codis, esquemes i grafs , 1987 .