A new family of optimal codes correcting term rank errors

Lund, David and Gabidulin, E. M. and Honary, Bahram (2000) A new family of optimal codes correcting term rank errors. In: Information Theory, 2000. Proceedings. IEEE International Symposium on. IEEE, Sorrento, Italy, p. 115. ISBN 0-7803-587-0

Full text not available from this repository.

Abstract

We consider messages represented as matrices. The term rank norm of a matrix is defined as minimal number of lines (rows and columns) which cover all the non zero entries of a matrix. We propose a family of codes correcting term rank errors. These codes are optimal since they reach the Singleton-type bound.

Item Type: Contribution in Book/Report/Proceedings
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 61132
Deposited By: ep_importer_pure
Deposited On: 11 Feb 2013 09:52
Refereed?: Yes
Published?: Published
Last Modified: 01 Jan 2020 05:41
URI: https://eprints.lancs.ac.uk/id/eprint/61132

Actions (login required)

View Item View Item