検索結果 2 件
デジタル記事
全国の図書館
- 件名linear array codes $\rho$-distance $\rho$-metric
- 関連情報Kyushu Journal of Mathematics || 62(1) || p189-200 http://www2.math.kyushu-u.ac.jp/~kjm/
- 著者標目Jain, Sapna
デジタル記事
インターネットで読める全国の図書館
- 要約等An array code/linear array code is a subset/s......tively, of the linear space Mat<I><SUB>m×s</SU...... <I>m × s</I> matrices with entries froma finite field <I>Fq</I> endowed with a non-Hamming metric known ......e RT-metric or $\\rho$-metric or <I>m</I>-metric. In this paper, we obtain a sufficient lower bound on the number ......f parity check digits required to achieve minimum $\\rho$-distance at least <I>d</I> 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<......</I>(<I>m × s, d</I>) where <I>......</I>(<I>m × s, d</I>) is the largest number of...
- 件名linear array codes $\\rho$-distance $\\rho$-metric
- 参照A Comparison of Signalling Alphabets Fundamentals of Error-Correcting Codes MacWilliams Duality and the Rosenbloom—Tsfasman Metric A new series of concatenated codes subject to matrix type-<te......t;B</tex>codes Campopiano-type bounds in non-Hamming array coding Multiple erro......orrection by means of parity checks Putin reads science the riot act Bursts in m-metric array codes The Complete Weight Enumerator for Codes over M nxs(F q)
検索結果は以上です。