Home         Authors   Papers   Year of conference   Themes   Organizations        To MES conference

Rank codes with partially known error basis
Authors
	Sysoev I.Y.
Date of publication
	2016
Abstract
	In this paper proposed decoding procedure using additional information. Additional information are the partially known error basis. This information may be read from previous decoding result or got from neighbor node in network coding. Author developed the algorithm for check additional information in rank codes, that is check whether if current error vector is contained in error set for received vector. The complexity of this operation is proportional to code distance d. In the case, when some elements from error basis are given, i.e. count known error - l, the complexity of Euclidean algorithm are proportional to the square of (d-l). The result may be used in development of rang codec.
Keywords
	rank codes, key equation, network coding, complexity, fast computing, decoder, optimization.
Library reference
	Sysoev I.Y. Rank codes with partially known error basis // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2016. Proceedings / edited by A. Stempkovsky, Moscow, IPPM RAS, 2016. Part 1. P. 261-265.
URL of paper
	http://www.mes-conference.ru/data/year2016/pdf/D192.pdf