A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
DOI10.1016/J.LAA.2010.11.007zbMath1223.05307OpenAlexW2055650051MaRDI QIDQ624531
Jianmin Ma, Kaishun Wang, Jun Guo, Feng-Gao Li
Publication date: 9 February 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.007
pooling designvertex transitive graphtotally isotropic subspaceCartesian authentication codedual polar scheme
Linear algebraic groups over finite fields (20G40) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Association schemes based on maximal totally isotropic subspaces in singular pseudo-symplectic spaces
- Pooling spaces associated with finite geometry
- Association schemes based on maximal isotropic subspaces in singular classical spaces
- Suborbits of \((m,k)\)-isotropic subspaces under finite singular classical groups
- Pooling designs associated with unitary space and ratio efficiency comparison
- Suborbits of \(m\)-dimensional totally isotropic subspaces under finite singular classical groups
- Construction of Cartesian authentication codes from unitary geometry
- Coherent configurations. I: Ordinary representation theory
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Subconstituents of dual polar graph in finite classical space. III
- Pooling spaces and non-adaptive pooling designs
- Codes Which Detect Deception
- Subconstituents of dual polar graphs in finite classical space. II
- New constructions of non-adaptive and error-tolerance pooling designs
This page was built for publication: A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
