Labelings of Lee and Hamming spaces
Discrete Mathematics
On Linear Codes over$${\mathbb{Z}}_{2^{s}}$$
Designs, Codes and Cryptography
Designs, Codes and Cryptography
The linear programming bound for codes over finite Frobenius rings
Designs, Codes and Cryptography
Hi-index | 754.84 |
We prove that, except for the well-known case p=k=2, it is not possible to construct a weight function on Z(pk) for which Z(pk) is isometric to Zp k with the Hamming metric