An upper bound on the size of m-ary t-sEC/AUED codes  

作　　者：ZHANG Peng-cheng FU Fang-wei CHANG Zu-ling 

机构地区：[1]School of Mathematical Sciences, Nankai University, Tianjin 300071, China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2006年第4期95-97,共3页中国邮电高校学报（英文版）

基　　金：the National Natural Science Foundation of China （60172060）.

摘　　要：Finding good upper bound for the size of m-ary t-symmetric error correcting codes （t-sEC/AUED codes） codes is the main problem in the coding theory of m-ary t-sEC/AUED codes. Based on the method of Lagrange multipliers, We shall derive an upper bound on the size of m-ary t-sEC/AUED in this paper. Some examples achieved this upper bound are also given in this paper.Finding good upper bound for the size of m-ary t-symmetric error correcting codes （t-sEC/AUED codes） codes is the main problem in the coding theory of m-ary t-sEC/AUED codes. Based on the method of Lagrange multipliers, We shall derive an upper bound on the size of m-ary t-sEC/AUED in this paper. Some examples achieved this upper bound are also given in this paper.

关 键 词：magnitude error criterion t-sEC/AUED codes unidirectional error Lagrange multipliers 

分 类 号：O236[理学—运筹学与控制论]