+7 (495) 987 43 74 ext. 3304
Join us -              
Рус   |   Eng

Authors

Pozdnyakova E.

Degree
Software Engineer, postgraduate student, Southern Federal University, FSASE SRI «Specvuzavtomatika»
E-mail
pozd.ka@gmail.com
Location
Rostov-on-Don
Articles

Symbolic erasure-correcting codes in random linear networks

The paper concentrating on random linear network coding in the presence of symbolic erasures besides packets errors and erasures. New models of network are constructed based on two new models of nodes with extended node alphabets. Alphabets of those nodes include special symbols to save linear transformation with corresponding coordinate of packet, which occurs during linear combinations on the following nodes on network. In the first model, extending alphabet contains only one special symbol “*”, in the second model, every node has personal alphabet that not intersected with others. Network coding methods based on Koetter-Kschischang-Silva network codes and channel errorcorrecting codes are represented. Coding methods are based on idea of cascading use of channel and network coders on network’s source. On sinks of network applies both as channel code decoder and network code decoder with some modifications in reverse order. First coding method uses first model of nodes and applied in case of number of symbols erasures does not exceed the error-correcting capability of channel code. In the opposite case are applied second model and corresponding coding method, which are representing probability decoder. An applicability opportunity of these methods to unauthorized using of linear networks by illegal user is noticed.
Read more...