Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
From MaRDI portal
Publication:4267787
DOI10.4153/CJM-1999-017-5zbMath0938.05018OpenAlexW2002698792MaRDI QIDQ4267787
Douglas R. Stinson, William J. Martin
Publication date: 5 October 1999
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1999-017-5
Monte Carlo methods (65C05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
On universally decodable matrices for space-time coding ⋮ A direct approach to linear programming bounds for codes and tms-nets ⋮ MacWilliams-type identities for fragment and sphere enumerators ⋮ Linear codes on posets with extension property ⋮ 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 ⋮ Spin Chains, Graphs and State Revival ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Terwilliger algebras of wreath products of one-class association schemes ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ Invariant Semidefinite Programs ⋮ A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays ⋮ Commutative association schemes ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ Harmonic analysis on totally disconnected groups and irregularities of point distributions ⋮ Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets ⋮ Association schemes on general measure spaces and zero-dimensional abelian groups
This page was built for publication: Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
