Performances of error-correction codes generated by non-linear iterative mappings

Error-correction codes presented in this paper are inspired by the random coding argument for block codes. These codes, generated by non-linear iterative mappings of deterministic chaos, certainly have random properties but they also possess deterministic features that can be useful for utilising practical decoding schemes. This paper investigates potential applicability of deterministic chaos in generation of binary block codes and block codes with continuous amplitude. Emphasis is given on determination of bounds on performance of these codes through a statistical approach. The results ale encouraging and leave substantial space for subsequent work. Estimated coding gain for binary codes with respect to the union coding bound of a class of binary codes is significant.