UNIV. NEWS. NORTH-CAUCAS. REG. TECHNICAL SCIENCES SERIES. 2016; 3: 31-37
http://dx.doi.org/10.17213/0321-2653-2016-3-31-37
ON THE NEW ERASURE-CORRECTION RANDOM NETWORK CODE CLASS
Deundyak Vladimir Mikhailovich – Candidate of Science in Physics and Maths, associate professor, Department «Algebra and Discrete Mathematics», Southern Federal University; associate professor FSASE SRI «Specvuzavtomatika», Rostov-on-Don, Russia. Ph. (863) 297-51-13 (additional 204). E-mail: vlade@math.rsu.ru
Pozdnyakova Ekaterina Aleksandrovna – Postraduate Student, Department «Algebra and Discrete Mathematics», Southern Federal University; associate professor FSASE SRI «Specvuzavtomatika»,
Abstract
The problem of multicast on linear network is considered, where linear transformation on data packets is done while transmitting through intermediate nodes. The ignorance of network structure and coefficients of linear transformations is supposed for random linear network. Special network codecs usually applied for transmission on such networks. In this paper random network is interpreted as foreign nonrandom network, new network code class for such networks is constructed, which differs with the simplicity of coding and decoding algorithms.
Keywords: linear network; random network; network coding; rank codes; rank network codes; erasures.
Full text: [in elibrary.ru]
References
1. Alshwede R., Cai N., Li S.-Y. R., Yeung R.W. Network information flow // IEEE Trans. Inform. Theory. 2000. V. 46. Pp. 1204–1216.
2. Koetter R., Kschischang F.R. Coding for errors and erasures in random network coding // IEEE Transactions on Information Theory. 2008. V. IT-54. № 8. Pp. 3579-3591.
3. Gabidulin E.M., Pilipchuk N.I., Kolybel'nikov A.I., Urivskii A.V., Vladimirov S.M., Grigor'ev A.A. Setevoe kodirovanie [Network coding]. Trudy MFTI, 2009, vol. 1, no. 2, pp. 3-28. [In Russ.]
4. Gabidulin E.M. Teoriya kodov s maksimal'nym rangovym rasstoyaniem [The theory of coding with maximal rank distance]. Problemy peredachi informatsii, 1985, vol. 21, no. 1, pp. 3–14. [In Russ.]
5. Silva D., Kschischang F.R., Koetter R. A Rank-Metric Approach to Error Control in Random Network Coding // IEEE Transactions on Information Theory. 2008. V. IT-54, № 9. Pp. 3951–3967.
6. Rashwan H., Pilipchuk N.I., Gabidulin E.M., Honary B. AGPT Cryptosystem for a Random Network Coding Channel // 3rd International Castle Meeting on Coding Theory and Applications.
7. Mikhailova E.A. Sistema zashchity Mak-Elisa v sluchainykh setyakh na baze setevogo koda Rida-Solomona [Mcelice Security System In Random Network Based On Reed-Solomon Network Code]. Izvestiya YuFU. Tekhnicheskie nauki, 2013, no. 12, pp. 200-209. [In Russ.]
8. Gabidulin E.M., Trushina O.V. Anonymous and secure network coding scheme // Seventh International Workshop on Optimal Codes and Related Topics. September 6-12, 2013,
9. Vinnichuk I.I., Kosolapov Yu.V. Otsenka stoikosti kodovogo zashumleniya k l-kratnomu chastichnomu nablyudeniyu v seti [The evaluation of code noising security against the l-fold partial data observation in the network]. Prikladnaya diskretnaya matematika, 2014, no. 4, pp. 62–71. [In Russ.]
10. Wang H., Xiao S., Kuo C.-C. J. Random linear network coding with ladder-shaped global coding matrix for robust video transmission // Journal of Visual Communication and Image Representation. 2011. № 22. Pp. 203–212
11. Heide J., Pedersen M.V., Fitzek F.H.P., Larsen T. Network Coding in the Real World // Network Coding. 2011. Chapter 4. Pp. 87-114.