|
Article information
2014 , Volume 19, ¹ 6, p.42-53
Kosolapov Y.V., Kurchev N.O.
Computation of the measure of resistance for Code Noising in a channel with random partial interception
Purpose. Generalize partial interception models discussed earlier, and to find the characteristics of linear codes, which determine the measure for resistance of the code noising. Methodology. We use the traditional methods of information theory and linear codes. Findings. The generalized model of random wire-tap II channel is constructed for the case, when the error-free main channel is protected by the code noising method. For the constructed model, the formula for the calculation of measures of resistance is obtained. It was found that the measure of resistance in general is the expectation of ranks for the projections of the check matrix of the base code to admissible sets of intercepted coordinates. Further, a more generalized model of interception is considered for two particular cases: a fixed number of equiprobable interception coordinates and the interception, the simulated channel with erasures with a fixed probability of erasure. In these cases, the formula for calculation the measures of resistance is greatly simplified when one of the spectral characteristics of the base code is considered. For the both of these special cases, the results of the calculation of measures of resistance in the case of some well-known codes are given. In particular, the results showed that a perfect security at random intercept of fixed number of coordinates may be achieved even at a greater quantity of observed coordinates compared to the model of initially known interception coordinates discussed by L.H. Ozarov and A.D. Wainer. Scope results. The results can be used in communications and distributed data storage systems, where the code noising is used to protect the data. Originality/value. The most interesting result is in the simplification of formulas for the calculation of measures of resistance to random interception when other special cases of interception along with the examination of specific basic codes are considered.
[full text]
Keywords: A random intercept, code noising, observer, uncertainty
Author(s):
Kosolapov Yury Vladimirovich
PhD.
Position: Associate Professor
Office: South Federal University
Address: 344006, Russia, Rostov, Bol'shaya Sadovaya st., 105/42
E-mail: itaim@mail.ru
SPIN-code: 8308-5636Kurchev Nuri Osmanovich
Position: Student
Office: South Federal University
Address: 344006, Russia, Rostov, Bol'shaya Sadovaya st., 105/42
E-mail: nuriabaza90@gmail.com
References:
[1] Wyner A. D. The wire-tap channel. Bell System Technical Journal. 1975; 54(8): 1355-1387.
[2] Ozarov L.H., Wyner A. D. Wire-Tap Channel II. Bell System Technical Journal. 1984; 63: 2135–2157.
[3] Korzhik V.I., Jakovlev V.A. None asymptotic estimates of efficiency of a code noising of one channel [Neasimptoticheskie ocenki jeffektivnosti kodovogo zashumlenija odnogo kanala]. Problemy peredachi informatsii. 1981; 17( 4): 11–18. (In Russ.)
[4] Kosolapov Ju. V., Nikulin V. Je. The Way of the organization of the distributed storage steady against a partial data leakage[ Sposob organizatsii raspredelennogo khranilichsha, ustojchivogo k chastichnoj utechke dannykh]. Materialy XIII Mezhdunar. nauchno-prakt. konf. "IB-2013".Ch. I. Taganrog: Izd-vo YuFU, 2013, 186–191. (In Russ.)
[5] Deundyak V.M., Kosolapov Ju.V. Mathematical model of the channel with interception of the second type [Matematicheskaya model' kanala s perekhvatom vtorogo tipa]. Izvestiya vysshikh uchebnykh zavedenij, Severo-Kavkazskij region, seriya Estestvennye nauki. 2008; 3(145): 3–8. (In Russ.)
[6] Wei V. K. Generalized Hamming Weights for Linear Codes. IEEE Transactions on information theory. 1991; 37(5): 1412–1418.
[7] Forney G. D. Dimension/length profiles and trellis complexity of linear block codes. IEEE Transactions on information theory. 1994; 40(6): 1741–1752.
[8] Rathi V., Andersson M., Thobaben R., Kliewer J., Skoglund M.Performance Analysis and Design of Two Edge Type LDPC Codes for the BEC Wiretap Channel. arXiv:1009.4610v2 [cs.IT].
[9] Deundyak V. M., Kosolapov Yu. V. [One method of removing the uncertainty in the channel with errors in the case of code noising [Ob odnom metode snyatiya neopredelennosti v kanale s pomekhami v sluchae primeneniya kodovogo zashumleniya]. Izvestiya YuFU. Tekhnicheskie nauki. 2014; 197–208. (In Russ.)
[10] Shankin G. P. The value of information. Problems in the theory and applications [Cennost' informatsii. Voprosy teorii i prilozhenij]. Moscow: Filomatis; 2004. 128.
[11]Tsimmerman K.-Kh. Methods of the theory of modular representations of algebraic coding theory [Metody teorii modulyarnykh predstavlenij v algebraicheskoj teorii kodirovaniya. Moscow: MTsNMO; 2011. 246.
[12] Sidelnikov V.M. A public-key cryptosystem based on binary Reed-Muller codes. Discrete Mathematics and Applications. 1994; 4(3): 191–207.
Bibliography link:
Kosolapov Y.V., Kurchev N.O. Computation of the measure of resistance for Code Noising in a channel with random partial interception // Computational technologies. 2014. V. 19. ¹ 6. P. 42-53
|
