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

Standard

A new family of optimal codes correcting term rank errors. / Lund, David ; Gabidulin, E. M.; Honary, Bahram.
Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy: IEEE, 2000. p. 115.

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

Harvard

Lund, D, Gabidulin, EM & Honary, B 2000, A new family of optimal codes correcting term rank errors. in Information Theory, 2000. Proceedings. IEEE International Symposium on. IEEE, Sorrento, Italy, pp. 115. https://doi.org/10.1109/ISIT.2000.866405

APA

Lund, D., Gabidulin, E. M., & Honary, B. (2000). A new family of optimal codes correcting term rank errors. In Information Theory, 2000. Proceedings. IEEE International Symposium on (pp. 115). IEEE. https://doi.org/10.1109/ISIT.2000.866405

Vancouver

Lund D, Gabidulin EM, Honary B. A new family of optimal codes correcting term rank errors. In Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy: IEEE. 2000. p. 115 doi: 10.1109/ISIT.2000.866405

Author

Lund, David ; Gabidulin, E. M. ; Honary, Bahram. / A new family of optimal codes correcting term rank errors. Information Theory, 2000. Proceedings. IEEE International Symposium on. Sorrento, Italy : IEEE, 2000. pp. 115

Bibtex

@inproceedings{6e3163d2054f474cb7675bfc60cc9b5c,
title = "A new family of optimal codes correcting term rank errors",
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.",
author = "David Lund and Gabidulin, {E. M.} and Bahram Honary",
year = "2000",
month = jun,
doi = "10.1109/ISIT.2000.866405",
language = "English",
isbn = "0-7803-587-0",
pages = "115",
booktitle = "Information Theory, 2000. Proceedings. IEEE International Symposium on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - A new family of optimal codes correcting term rank errors

AU - Lund, David

AU - Gabidulin, E. M.

AU - Honary, Bahram

PY - 2000/6

Y1 - 2000/6

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2000.866405

DO - 10.1109/ISIT.2000.866405

M3 - Conference contribution/Paper

SN - 0-7803-587-0

SP - 115

BT - Information Theory, 2000. Proceedings. IEEE International Symposium on

PB - IEEE

CY - Sorrento, Italy

ER -