NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large eno...NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large enough, Nguyen et al. select two classes of maxi-mum distance separable(MDS) codes which are q-ary Reed-Solomon (R-S) codes and q-arygeneralized Berlekamp-Justesen(B-J) codes. The generalized B-J codes are more展开更多
文摘NGUYEN et al. give a method for constructing binary CP constant-weight (CPC) codes,then they construct protocol sequences with good performance by using the codes. To makethe minimum distance of the CP codes large enough, Nguyen et al. select two classes of maxi-mum distance separable(MDS) codes which are q-ary Reed-Solomon (R-S) codes and q-arygeneralized Berlekamp-Justesen(B-J) codes. The generalized B-J codes are more
