By Topic

A new method of erasure correction by rank codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. M. Gabidulin ; Moscow Inst. of Phys. & Technol., Dolgoprudny, Russia ; N. I. Pilipchuk

In this paper, We introduce a notion of rank erasure and present a new algorithm of correcting rank erasures based on the matrix representation of the symmetric maximal rank distance (MRD) (N,1,N) codes. It reduces at least twice the complexity of rank erasure decoding.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003