Abstract

In [16], the author introduced a new pseudo-metric on the space Matm×s(Zq) which is the module space of all m × s matrices with entries from the finite ring Zq generalizing the classical Lee metric (see [17]) and the array RT- metric (see [19]) and named this pseudo-metric as the Generalized-Lee-RT-Pseudo-Metric (or the GLRTP-Metric). In this paper, we obtain some lower bounds for two dimensional array codes correcting burst errors (see [10]) with weight constraints under the GLRTP-metric.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call