Subspaces in \(d\)-bounded distance-regular graphs and authentication code with perfect secrecy. (Q2804778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6577862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subspaces in \(d\)-bounded distance-regular graphs and authentication code with perfect secrecy. |
scientific article; zbMATH DE number 6577862 |
Statements
4 May 2016
0 references
distance-regular graph
0 references
subspace
0 references
\(d\)-bounded graph
0 references
authentication code
0 references
Subspaces in \(d\)-bounded distance-regular graphs and authentication code with perfect secrecy. (English)
0 references
0.915377676486969
0 references
0.8142706155776978
0 references
0.7656201124191284
0 references
0.7572042942047119
0 references
