Computer search for binary cyclic UEP codes of odd length up to 65
IEEE Transactions on Information Theory（1990）
摘要
Exhaustive computation by a computer was used to find the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances of at least 3. For those codes for which upper bounds can only be computed on their unequal error protection capabilities, an analytic method developed by V.N. Dynkin and V.A. Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities
更多查看译文
关键词
unequal error protection capability,odd length,binary cyclic codes,minimum distance,error correction codes,binary cyclic code,exact unequal error protection,uep code,analytic method,upper bound,computer search,unequal error protection,telecommunications computing,upper bounds,exhaustive computation,hamming weight,cyclic code,linear code,analytic functions,cybernetics,algorithms,binary codes,decoding,vectors
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要