论文信息 - A Lloyd Theorem in Weakly Metric Association Schemes

A Lloyd Theorem in Weakly Metric Association Schemes

Weakly metric association schemes are a generalization of metric schemes occurring in graph theory (vertex transitive digraphs), coding theory (Lee scheme, Clark-Liang scheme), and group theory (conjugacy scheme). Linear constraints on the inner distribution of r-covering codes in these schemes lead to a ‘Lloyd theorem’ on perfect codes. This generalizes results from Delsarte, Biggs, Bassalygo and Landauer.

Patrick Solé

[1] N. Biggs. Perfect codes in graphs , 1973 .

[2] Marc J. Bage. Lattice quantizers: Entropy reduction by proper tie-handling , 1986, IEEE Trans. Inf. Theory.

[3] Patrick Solé. The Lee Association Scheme , 1986, Coding Theory and Applications.

[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[5] Gérard D. Cohen,et al. Distances invariantes et L-cliques sur certains demi-groupes finis , 1979 .

[6] Sylvia M. Jennings. On Computing the Performance Probabilities of Reed-Solomon Codes , 1985, AAECC.

[7] S. P. Lloyd. Binary block coding , 1957 .

[8] Gwihen Etienne. Perfect Codes and Regular Partitions in Graphs and Groups , 1987, Eur. J. Comb..

[9] J. H. van Lint. Coding theory introduction , 1988 .

[10] N. J. A. Sloane,et al. Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.