http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
오늘 본 자료
(1, 3) solid burst-correcting optimal linear codes over GF(5)
TARUN LATA 장전수학회 2018 Proceedings of the Jangjeon mathematical society Vol.21 No.4
In 2012, Das [5] had obtained a lower bound on the neces- sary number of parity-check digits in an (n = n₁ + n₁, k) linear codes over GF(2) which are optimal in a specic sense viz. which are capa- ble to correct single errors in the rst sub-block of length n1 and solid bursts of length 3 or less in the second sub-block of length n2 as well as gave sucient condition for the existence of such codes. Later, Lata and Tyagi [9] had studied these codes over GF(3). In this paper, the author examines the possibility of the existence of such codes over GF(5).