In the article are defined nonlinear n-gonal block codes. The methods of constructing n-gonal codes are considered. Suggest efficient universal recursive methods of constructing codes great length on the basis of block design for error-correcting code. On the basis of these methods can be constructed error-correcting codes for any predetermined number of errors. Among the codes with a predetermined length codeword and a predetermined number of units in the word, these codes will have a maximum number of codewords. Dignity of these codes is speed of encoding and decoding. Also possibility of fast change of a code without change of tables of encoding and decoding. This makes it possible to use these in cryptosystems.
展开▼
