Codes and projective multisets (Q1128359)

It is well-known that any projective two-weight code corresponds to some \((n,k,h_1,h_2)\)-set in an appropriate finite projective space. More generally, any full-length linear code (i.e., the generator matrix contains no zero columns) corresponds to a suitable multiset in some finite projective space. One may then apply a dual transform of projective multisets to construct further codes. A striking example for this approach is given in a recent paper by \textit{A. E. Brouwer} and \textit{M. van Eupen} [``The correspondence between projective codes and 2-weight codes'', Designs, Codes Cryptography 11, 261-266 (1997; Zbl 0872.94043)], where subsets of finite projective space are transformed into multisets of the dual space; in this way, with any projective code one can associate a 2-weight code. In the paper under review, these ideas are systematically studied; in particular, a matrix-free presentation of the correspondence between projective multisets and linear codes is given, short proofs for some known results are presented and a new notion of self-duality is introduced.