Bounds on mixed binary/ternary codes

作     者：Brouwer, AE Hamalainen, HO Ostergard, PRJ Sloane, NJA 

作者机构：Eindhoven Univ Technol Dept Math NL-5600 MB Eindhoven Netherlands Helsinki Univ Technol Dept Comp Sci & Engn HUT 02015 Finland AT&T Bell Labs Res Informat Sci Res Ctr Florham Park NJ 07932 USA 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：1998年第44卷第1期

页      面：140-161页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Academy of Finland 

主　　题：binary codes clique finding linear programming bound mixed codes tabu search ternary codes 

摘      要：Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included, The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.