Journal ArticleOPEN ACCESS

Codes and anticodes in the Grassman graph

Journal of Combinatorial Theory. Series A (2002) 97(1) 27-42
DOI: 10.1006/jcta.2001.3188
78Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Perfect codes and optimal anticodes in the Grassman graph Gq(n,k) are examined. It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when n=2k. We further examine properties of diameter perfect codes in the graph. These codes are known to be similar to Steiner systems. We discuss the connection between these systems and "real" Steiner systems. © 2001 Elsevier Science.

Author supplied keywords

Cite

CITATION STYLE

APA

Schwartz, M., & Etzion, T. (2002). Codes and anticodes in the Grassman graph. Journal of Combinatorial Theory. Series A, 97(1), 27–42. https://doi.org/10.1006/jcta.2001.3188

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free