In this project we propose the design of codes which allow us the correction and/or detection of many errors. We want to reach some codes with a complexity like that of the Reed-Solomon codes. These kind of codes will be reached from the graph theory, by using techniques like the Chinese remaindering or the continued fractions, but always using this techniques from a different point of view than the normal one used in the classic algebraic descodification. The cryptographic tool tries to improve the well known sharing schemes from the users keys of the LAN. The simulation of the previous tools will be implemented in a LAN in which a Markov chain will give us the errors distribution of digital channel. Firsts we will do a statiscal study to adapt the simulation to some real situations. Second we will integrate the modulates designed in the different OSI levels of the network
|Effective start/end date||1/04/91 → 31/03/92|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.