Eiichi Bannai

,

Tsuyoshi Miezaki

,

Hiroyuki Nakasora

Des. Codes Cryptogr., 2023

A note on the Assmus-Mattson theorem for some non-binary codes (a resume).

[BibT_eX]

[DOI]

,

Tsuyoshi Miezaki

,

Hiroyuki Nakasora

CoRR, 2023

Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2022

The complex conjugate invariants of Clifford groups.

[BibT_eX]

[DOI]

,

Manabu Oura

,

Da Zhao

Des. Codes Cryptogr., 2021

Spherical Embeddings of Symmetric Association Schemes in 3-Dimensional Euclidean Space.

[BibT_eX]

[DOI]

,

Da Zhao

Graphs Comb., 2020

Tight t-designs on one shell of Johnson association schemes.

[BibT_eX]

[DOI]

,

Yan Zhu

Eur. J. Comb., 2019

Harmonic Index Designs in Binary Hamming Schemes.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2017

Design Theory from the Viewpoint of Algebraic Combinatorics.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2017

Relative t-designs in binary Hamming association scheme H(n, 2).

[BibT_eX]

[DOI]

,

,

Yan Zhu

Des. Codes Cryptogr., 2017

On Spherical Designs of Some Harmonic Indices.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2017

Tight relative 2-designs on two shells in Johnson association schemes.

[BibT_eX]

[DOI]

Yan Zhu

,

,

Discret. Math., 2016

Spherical designs of harmonic index t.

[BibT_eX]

[DOI]

,

Takayuki Okuda

,

Makoto Tagami

J. Approx. Theory, 2015

On Relative $t$-Designs in Polynomial Association Schemes.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2015

Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes.

[BibT_eX]

[DOI]

Zengti Li

,

,

Graphs Comb., 2014

On the existence of tight relative 2-designs on binary Hamming association schemes.

[BibT_eX]

[DOI]

,

,

Hideo Bannai

Discret. Math., 2014

t-Designs with the number of blocks close to the Fisher type lower bound.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2013

Maximal m-distance sets containing the representation of the Johnson graph J(n, m).

[BibT_eX]

[DOI]

,

Takahiro Sato

,

Junichi Shigezumi

Discret. Math., 2012

Cubature formulas in numerical analysis and Euclidean tight designs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2010

Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets.

[BibT_eX]

[DOI]

Kanat S. Abdukhalikov

,

,

Sho Suda

J. Comb. Theory A, 2009

A survey on spherical designs and algebraic combinatorics on spheres.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2009

Finite Euclidean graphs and Ramanujan graphs.

[BibT_eX]

[DOI]

,

Osamu Shimabukuro

,

Hajime Tanaka

Discret. Math., 2009

Uniqueness of certain association schemes.

[BibT_eX]

[DOI]

,

,

Hideo Bannai

Eur. J. Comb., 2008

On the strong non-rigidity of certain tight Euclidean designs.

[BibT_eX]

[DOI]

,

,

Djoko Suprijanto

Eur. J. Comb., 2007

On optimal tight 4-designs on 2 concentric spheres.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2006

On primitive symmetric association schemes with m<sub>1</sub>=3.

[BibT_eX]

[DOI]

,

Contributions Discret. Math., 2006

A note on the spherical embeddings of strongly regular graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2005

Finite analogues of non-Euclidean spaces and Ramanujan graphs.

[BibT_eX]

[DOI]

,

Osamu Shimabukuro

,

Hajime Tanaka

Eur. J. Comb., 2004

Johan Jacob Seidel 1919-2001.

[BibT_eX]

[DOI]

,

Willem H. Haemers

,

Patrick Solé

Eur. J. Comb., 2004

Codes and designs in Grassmannian spaces.

[BibT_eX]

[DOI]

Christine Bachoc

,

,

Renaud Coulangeon

Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2003

Type II Codes, Even Unimodular Lattices, and Invariant Rings.

[BibT_eX]

[DOI]

,

,

,

IEEE Trans. Inf. Theory, 1999

Introduction.

[BibT_eX]

[DOI]

,

Patrick Solé

Eur. J. Comb., 1999

On the Ring of Simultaneous Invariants for the Gleason-MacWilliams Group.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 1999

Character Tables of Fission Schemes and Fusion Schemes.

[BibT_eX]

[DOI]

,

Sung Yell Song

Eur. J. Comb., 1993

On a theorem of Ikuta, Ito and Munemasa.

[BibT_eX]

[DOI]

Eur. J. Comb., 1992

Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points.

[BibT_eX]

[DOI]

,

Shen Hao

,

Sung-Yell Song

J. Comb. Theory A, 1990

On the character table of the association scheme<i>Sp(4, q)/Sz(q)</i>.

[BibT_eX]

[DOI]

,

Sung-Yell Song

Graphs Comb., 1989

On Distance-regular Graphs with Fixed Valency, IV.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1989

Tight t-Designs and Squarefree Integers.

[BibT_eX]

[DOI]

,

Stuart G. Hoggar

Eur. J. Comb., 1989

On distance-regular graphs with fixed valency, II.

[BibT_eX]

[DOI]

,

Graphs Comb., 1988

On distance-regular graphs with fixed valency.

[BibT_eX]

[DOI]

,

Graphs Comb., 1987

Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I.

[BibT_eX]

[DOI]

,

Graphs Comb., 1986

An Addition Formula for Hyperbolic Space.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 1984

An upper bound for the cardinality of an s-distance subset in real Euclidean space, II.

[BibT_eX]

[DOI]

,

,

Dennis Stanton

Comb., 1983

Nonexistence of certain distance-transitive digraphs.

[BibT_eX]

[DOI]

,

Peter J. Cameron

,

Jeff Kahn

J. Comb. Theory B, 1981

Regular graphs with excess one.

[BibT_eX]

[DOI]

,

Discret. Math., 1981

An upper bound for the cardinality of an s-distance subset in real Euclidean space.

[BibT_eX]

[DOI]

,

Comb., 1981

How many P-polynomial Structures can an Association Scheme have?

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1980

On the Weight Distribution of Spherical t-designs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

On the spectra of certain distance-regular graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1979

On Some Spherical t-Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1979

On Tight Spherical Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1979

On Perfect Codes in the Hamming Schemes H(n, q) with q Arbitrary.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

Examples of groups which have a graphical regular representation.

[BibT_eX]

[DOI]