Self-dual codes in Rosenbloom-Tsfasman metric
Marka, Venkatrajam ; Selvaraj, R.S. ; Gnanasudha, Irrinki
Mathematical Communications, Tome 22 (2017) no. 1, p. 75-87 / Harvested from Mathematical Communications
This paper deals with the study and construction of self-dual codes equipped with Rosenbloom-Tsfasman metric (RT-metric, in short). An [s, k] linear code in RT-metric over Fq has codewords with k different non-zero weights. Using the generator matrix in standard form of a code in RT-metric, the standard information set for the code is defined. Given the standard information set for a code, that for its dual is obtained. Moreover, using the basic parameters of a linear code, the covering radius and the minimum distance of its dual are also obtained. Eventually, necessary and sufficient conditions for a code to be self-dual are established. In addition, some methods for constructing self dual codes are proposed and illustrated with examples.
Publié le : 2017-02-17
Classification:  linear code; self-dual code; standard information set; covering radius; RT-metric,  94B75; 94B05; 94B60
@article{mc1743,
     author = {Marka, Venkatrajam and Selvaraj, R.S. and Gnanasudha, Irrinki},
     title = {Self-dual codes in Rosenbloom-Tsfasman metric},
     journal = {Mathematical Communications},
     volume = {22},
     number = {1},
     year = {2017},
     pages = { 75-87},
     language = {eng},
     url = {http://dml.mathdoc.fr/item/mc1743}
}
Marka, Venkatrajam; Selvaraj, R.S.; Gnanasudha, Irrinki. Self-dual codes in Rosenbloom-Tsfasman metric. Mathematical Communications, Tome 22 (2017) no. 1, pp.  75-87. http://gdmltest.u-ga.fr/item/mc1743/