Identifying codes of Cartesian product of two cliques of the same size.
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Codes and designs from triangular graphs and their line graphs”
Identifying codes of Cartesian product of two cliques of the same size.
Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ternary constant weight codes.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On identifying codes in the King grid that are robust against edge deletions.
Honkala, Iiro, Laihonen, Tero (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yet another distance regular graph related to a Golay code.
Soicher, Leonard H. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
1-perfect codes over self-complementary graphs
Jan Kratochvíl (1985)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Balanced Gray codes.
Bhat, Girish S., Savage, Carla D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfect codes in regular graphs
I. Dvořáková-Rulićová (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Creation of unequal error protection codes for two groups of symbols
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.