BURST-ERROR-CORRECTING CODES WITH WEIGHT-CONSTRAINTS UNDER A NEW METRIC
Manohar Lal Kaushik · Journal of Cybernetics · 1978
This paper discusses Varshamov-Gilbert bound, sphere-packing bound and some other problems of burst-error-correcting codes with weight constraints under a new metric. The new metric, introduced in an earlier paper, is defined in terms of suitable partition of the alphabet, the ring Z q, of integers mod q. In general, different partitions of the same alphabet lead to different metrices. The partition of the alphabet {0, 1, 2, ⃛, q − 1} given by {0} and {l, 2, ⃛, q − 1} determines Hamming metric. Also, for the partition ρ L = {B 0, B 1, ⃛,B⌞q/2⌟} where B 0 = {0} and B 0,= {i, q −i} for i = 1, 2 ⃛,⌞q/2⌟ the metric reduces to Lee metric.