|
This paper expands on the concept of quality and links it with the concept of fractal by means of Theory of secrecy, taking into account that the additive model of quality has virtually the same mathematical expression as one of the models presented by C. E. Shannon in his work regarding Theory of secrecy. Based on the theory of Shannon, a possible enciphering model is constructed. This model generated to implement the theory of Shannon is explained for the general case and then based on this, a particular model is presented. This particular model is then approached using a set of C++ subroutines which implement the subject model. This paper shows that, if quality evolution is properly analyzed, quality could be to a certain extent, also predicted. Furthermore, this prediction of quality can be used in a more general way, namely to predict evolution in a structure exhibiting more features or dimensions, such as, for example, a fractal structure such as presented in [3], [4] and [5]. Taking into account that the very same weighted addition method or model is used for both, to generate the encryption in a secrecy system, but also to calculate the quality value of a product or service exhibiting a certain number of quality features, one can link these two in an appropriate way, such as will be presented in this paper. Thus, quality evolution properly analyzed, could lead also to a prediction to a certain extent, of the respective quality. This paper extends the work of C. E. Shannon and is based on his papers: Communication Theory of Secrecy Systems and A Mathematical Theory of Communication The theory presented and developed by Shannon has been successfully used and has been proven during the last seventy years since its discovery. This theory is practically used in this paper by means of particular encryption/ decryption C++ algorithms, which show how to put this theory into practice in order to make predictions about quality or other abstract or material natural systems. These C++ subroutines may very well be extended for a more general, complicated case of encryption, similar to the enciphering case presented in this paper. The algorithms presented in this paper show how an encryption model should be approached using a certain software. This paper also expands previous results obtained by author in [3], [4] and [5].
|
