Abstract
In this paper we present some results in graphs which extends combinatorial results in coding theory. The basic concept is the structure of coherent partition.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Bannai, and T. Ito. “Algebraic combinatorics I: Association schemes”. Benjamin-Cummings, Menlo Park, 1984.
P. Camion. (private communication).
P. Camion, B. Courteau, and P. Delsarte. On r-partition designs in Hamming spaces. Tech. Rep. 626, INRIA, 1987. (submitted to Discrete Math. in 1986).
P. Camion, B. Courteau, G. Fournier, and S.V. Kanetkar. Weight distribution of translates of linear codes and generalized Pless identities. J. Inform. Optim. Sci. 8 (1987), 1–23.
P. Delsarte. An algebraic approach to the association schemes of coding theory. Philips Res. Repts Suppl. 10 (1973). (Ph.D. thesis, Université Catholique de Louvain, 1973).
A. Montpetit. “Codes dans les graphes réguliers”. Ph.D. thesis, Université de Sherbrooke, 1987.
A. Montpetit. Codes et partitions cohérentes dans les graphes réguliers. Ann. sc. math. Québec 14 (1990).
A. Montpetit. Une généralisation d'un théorème de Delsarte dans les graphes de Cayley. Ann. sc. math. Québec 15 (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montpetit, A. (1991). Coherent partitions and codes. In: Cohen, G., Charpin, P. (eds) EUROCODE '90. EUROCODE 1990. Lecture Notes in Computer Science, vol 514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54303-1_123
Download citation
DOI: https://doi.org/10.1007/3-540-54303-1_123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54303-9
Online ISBN: 978-3-540-47546-0
eBook Packages: Springer Book Archive