ON PERFECT CODES IN THE LEE-ROSENBLOOM-TSFASMAN-JAIN METRIC

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Sigma Mühendislik ve Fen Bilimleri Dergisi
Volume:37 Issue:4
ON PERFECT CODES IN THE LEE-ROSENBLOOM-TSFASMAN-JAIN METRIC

ON PERFECT CODES IN THE LEE-ROSENBLOOM-TSFASMAN-JAIN METRIC

Authors : Merve BULUT YILGÖR, Fatih DEMİRKALE

Pages : 1325-1333

View : 58 | Download : 7

Publication Date : 2019-12-01

Article Type : Research Paper

Abstract :In this paper, we study perfect codes in the Lee-Rosenbloom-Tsfasman-Jain insert ignore into journalissuearticles values(LRTJ); metric over the finite field Z_p. We begin by deriving some new upper bounds focusing on the number of parity check digits for linear codes correcting all error vectors of LRTJ weight up to w, 1≤w≤4. Furthermore, we establish sufficient conditions for the existence of perfect codes correcting all error vectors with certain weights. We also search for linear codes which attain these bounds to determine the possible parameters of perfect codes. Moreover, we derive parity check matrices corresponding linear codes correcting all error vectors of LRTJ weight 1 over Z_p, and correcting all error vectors of LRTJ weight up to 2 over Z_3 and Z_11. We also construct perfect codes for these cases. Lastly, we obtain non-existence results on w-perfect linear codes over Z_p for 2≤w≤4.
Keywords : Linear codes, perfect codes, LRTJ weight, LRTJ metric

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.