Home > Research > Publications & Outputs > A new family of optimal codes correcting term r...
View graph of relations

A new family of optimal codes correcting term rank errors

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date06/2000
Host publicationInformation Theory, 2000. Proceedings. IEEE International Symposium on
Place of PublicationSorrento, Italy
PublisherIEEE
Pages115
ISBN (Print)0-7803-587-0
<mark>Original language</mark>English

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.