Abstract:
This paper covers the problems of packet and symbol erasures in binary linear networks. A method based on sequential cascading of network and channel codes to resist symbol erasures is described. The channel code is considered to be a code based on equal-weight columns. A non-linear subcode of rank code is used as a network code. Encoding and decoding algorithms for cascading code are constructed. A simulation model has been developed. With the help of this model experiments have been carried out to show the effectiveness of the presented method.
Citation:
E. E. Aydarkin, V. M. Deundyak, “Channel-network cascade for packet and symbol erasures in binary linear network”, J. Comp. Eng. Math., 7:2 (2020), 3–14
\Bibitem{AydDeu20}
\by E.~E.~Aydarkin, V.~M.~Deundyak
\paper Channel-network cascade for packet and symbol erasures in binary linear network
\jour J. Comp. Eng. Math.
\yr 2020
\vol 7
\issue 2
\pages 3--14
\mathnet{http://mi.mathnet.ru/jcem165}
\crossref{https://doi.org/10.14529/jcem200201}
Linking options:
https://www.mathnet.ru/eng/jcem165
https://www.mathnet.ru/eng/jcem/v7/i2/p3
This publication is cited in the following 1 articles:
E. E. Aydarkin, V. M. Deundyak, “O kanalno-setevom kaskade dlya borby s paketnymi i simvolnymi stiraniyami v binarnoi lineinoi seti”, J. Comp. Eng. Math., 7:2 (2020), 3–14
Citation in format AMSBIB
Contact us: