Sep 19, 1991 · In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined ...

In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear ...

Paul Camion, Bernard Courteau, Philippe Delsarte: On r-Partition Designs in Hamming Spaces. Appl. Algebra Eng. Commun. Comput. 2: 147-162 (1991).

We will also treat the problem of determining if a matrix is the adjacency matrix of a unique (up to isometry) partition design of the binary Hamming graph.

Rapport (Rapport De Recherche) Année : 1991. On r-partition designs in hamming spaces. Paul Camion (1) , Bernard Courteau (1) , Philippe Delsarte.

We will also treat the problem of determining if a matrix is the adjacency matrix of a unique (up to isometry) partition design of the binary Hamming graph.

May 24, 2006 · HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub-.

J. Simonis, The paper, On r-partition designs in Hamming spaces, by Camion, Corteau, Delsarte, Lecture Notes for an EIDMA Graduate Course, Delft University of ...

spaces allows many properties to be transferred back and forth: 26. Codes and projective spaces. 1. The Hamming codes correspond to the entire projective space.