Error-detecting for Combinatorial Codes

Kaihong Wang · Harbin Ligong Daxue xuebao · 2003

The dimension of combinatorial codes is presented in this paper, making use of the generator matrix of combinatorial codes as the check matrix of its dual codes, we give a conclusion that the minimum distance of combinatorial codes' dual codes is bigger than 1. And the weight distribution of the combinatorial codes are given. At last some combinatorial codes are the proper code for error detection.

Read the paper · More papers on PaperTik