## ＜紀要論文＞AN ALGORITHMIC APPROACH TO ACHIEVE MINIMUM $\rho$-DISTANCE AT LEAST d IN LINEAR ARRAY CODES

作成者 作成者名 所属機関 所属機関名 Department of Mathematics, University of Delhi 英語 Faculty of Mathematics, Kyushu University 九州大学大学院数理学研究院 2008-03 62 1 189 200 Version of Record restricted access Kyushu Journal of Mathematics || 62(1) || p189-200 http://www2.math.kyushu-u.ac.jp/~kjm/ An array code/linear array code is a subset/subspace, respectively, of the linear space $mathrm{Mat}_{m chi s} (F_q)$, the space of all $m chi s$ matrices with entries froma finite field $F_q$ e...ndowed with a non-Hamming metric known as the RT-metric or $\rho$-metric or $m$-metric. In this paper, we obtain a sufficient lower bound on the number of parity check digits required to achieve minimum $\rho$-distance at least $d$ in linear array codes using an algorithmic approach. The bound has been justified by an example. Using this bound, we also obtain a lower bound on the number$B_q (m chi s, d)$ where $B_q(m chi s, d)$ is the largest number of code matrices possiblein a linear array code $V subseteq mathrm{Mat}_{m chi s} (Fq)$ having minimum $\rho$-distance at least $d$.続きを見る

### 詳細

レコードID 11791 査読有 linear array codes $\rho$-distance $\rho$-metric 1340-6116 10.2206/kyushujm.62.189 紀要論文 2009.09.25 2018.02.01