摘要
本文对多址可加信道分组编码进行了研究,得出了唯一可译性的充要条件及有关判别准则,并对译码算法进行了探讨.
in this paper, we present the sufficient and necessary condition of unique decodability of block codes for multiple-access adder channels and relerant criterions. The decoding algorithms are investigated for the uniquely decodable block codes.
出处
《应用数学学报》
CSCD
北大核心
1996年第1期1-9,共9页
Acta Mathematicae Applicatae Sinica