On Optimal Homogeneous-Metric Codes
For coding theorists, this provides a complete characterization of MHD codes and resolves an open problem in constant-weight codes.
The paper characterizes Maximum Homogeneous Distance (MHD) codes over finite chain rings, showing they coincide with lifted MDS codes and are contained in the socle at low rank, with exceptions from exceptional MDS or single-parity-check codes. It also closes a gap in constant homogeneous-weight codes by identifying those of minimal length.
The homogeneous metric can be viewed as a natural extension of the Hamming metric to finite chain rings. It distinguishes between three types of elements: zero, non-zero elements in the socle, and elements outside the socle. Since the Singleton bound is one of the most fundamental and widely studied bounds in classical coding theory, we investigate its analogue for codes over finite chain rings equipped with the homogeneous metric. We provide a complete characterization of Maximum Homogeneous Distance (MHD) codes, showing that MHD codes coincide with lifted MDS codes and are contained within the socle at low rank. Exceptions arise from exceptional MDS codes or single-parity-check codes. We then shift our focus to the Plotkin-type bound in the homogeneous metric and close an existing gap in the theory of constant homogeneous-weight codes by identifying those of minimal length.