Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
From MaRDI portal
Publication:4267787
Recommendations
Cited in
(25)- A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
- Commutative association schemes
- A note on geometric structures of linear ordered orthogonal arrays and (t,m,s)-nets of low strength
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- Bounds on covering codes in RT spaces using ordered covering arrays
- Association schemes on general measure spaces and zero-dimensional abelian groups
- On universally decodable matrices for space-time coding
- A direct approach to linear programming bounds for codes and tms-nets
- Constructions of (t,m,s)-nets and (t,s)-sequences
- Invariant Semidefinite Programs
- Spin chains, graphs and state revival
- Harmonic analysis on totally disconnected groups and irregularities of point distributions
- Bounds on ordered codes and orthogonal arrays
- Linear codes on posets with extension property
- scientific article; zbMATH DE number 1390119 (Why is no real title available?)
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- Quantum walks on simplexes and multiple perfect state transfer
- Existence of small ordered orthogonal arrays
- Approximation of integration over finite groups, difference sets and association schemes
- Wreath products and projective system of non-Schurian association schemes
- The triple distribution of codes and ordered codes
- Divisible pre-difference sets for approximating integrations over finite groups
- MacWilliams-type identities for fragment and sphere enumerators
- New explicit bounds for ordered codes and (t,m,s)-nets
- Terwilliger algebras of wreath products of one-class association schemes
This page was built for publication: Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267787)
