Nonlinear double-error-correcting binary codes of length (2 to the nth power)-1 are presented in this paper. They can be encoded as systematic codes and have the largest possible number of code words for their length and minimum distance, that is, are optimum. The complexity of the encoding and decoding operations is comparable to the one of the corresponding linear codes. (Author)
展开▼
