【摘要】 本文推广和改进了D.K.Pradhan和B.Bose的一些结果。更多还原

【Abstract】 In this paper, a class of codes capable of correcting t errors anddetecting multiple unidirectional errors (t EC-MUED code) is discussed. It is proved that a systematic tEC-MUED code with k information bits requires at least [(t +1)log2k-log2((t + 1)1)]-1 check bits. A class of systematic 2EC-MUED code requiring at most [6 log2k + log2 log2 k + 1] check bits is also given. Finally a conjecture about tEC-MUED code is developed.更多还原