Eiichi Bannai

According to our database1, Eiichi Bannai authored at least 54 papers between 1977 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A note on the Assmus-Mattson theorem for some binary codes II.
Des. Codes Cryptogr., 2023

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

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

2021
The complex conjugate invariants of Clifford groups.
Des. Codes Cryptogr., 2021

2020
Spherical Embeddings of Symmetric Association Schemes in 3-Dimensional Euclidean Space.
Graphs Comb., 2020

2019
Tight t-designs on one shell of Johnson association schemes.
Eur. J. Comb., 2019

2017
Harmonic Index Designs in Binary Hamming Schemes.
Graphs Comb., 2017

Design Theory from the Viewpoint of Algebraic Combinatorics.
Graphs Comb., 2017

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

On Spherical Designs of Some Harmonic Indices.
Electron. J. Comb., 2017

2016
Tight relative 2-designs on two shells in Johnson association schemes.
Discret. Math., 2016

2015
Spherical designs of harmonic index t.
J. Approx. Theory, 2015

On Relative $t$-Designs in Polynomial Association Schemes.
Electron. J. Comb., 2015

2014
Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes.
Graphs Comb., 2014

On the existence of tight relative 2-designs on binary Hamming association schemes.
Discret. Math., 2014

2013
t-Designs with the number of blocks close to the Fisher type lower bound.
J. Comb. Theory, Ser. A, 2013

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

2010
Cubature formulas in numerical analysis and Euclidean tight designs.
Eur. J. Comb., 2010

2009
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets.
J. Comb. Theory, Ser. A, 2009

A survey on spherical designs and algebraic combinatorics on spheres.
Eur. J. Comb., 2009

Finite Euclidean graphs and Ramanujan graphs.
Discret. Math., 2009

2008
Uniqueness of certain association schemes.
Eur. J. Comb., 2008

2007
On the strong non-rigidity of certain tight Euclidean designs.
Eur. J. Comb., 2007

2006
On optimal tight 4-designs on 2 concentric spheres.
Eur. J. Comb., 2006

On primitive symmetric association schemes with m<sub>1</sub>=3.
Contributions Discret. Math., 2006

2005
A note on the spherical embeddings of strongly regular graphs.
Eur. J. Comb., 2005

2004
Finite analogues of non-Euclidean spaces and Ramanujan graphs.
Eur. J. Comb., 2004

Johan Jacob Seidel 1919-2001.
Eur. J. Comb., 2004

Codes and designs in Grassmannian spaces.
Discret. Math., 2004

2003
Preface.
Discret. Math., 2003

1999
Type II Codes, Even Unimodular Lattices, and Invariant Rings.
IEEE Trans. Inf. Theory, 1999

Introduction.
Eur. J. Comb., 1999

On the Ring of Simultaneous Invariants for the Gleason-MacWilliams Group.
Eur. J. Comb., 1999

1993
Character Tables of Fission Schemes and Fusion Schemes.
Eur. J. Comb., 1993

1992
On a theorem of Ikuta, Ito and Munemasa.
Eur. J. Comb., 1992

1990
Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points.
J. Comb. Theory, Ser. A, 1990

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

On Distance-regular Graphs with Fixed Valency, IV.
Eur. J. Comb., 1989

Tight t-Designs and Squarefree Integers.
Eur. J. Comb., 1989

1988
On distance-regular graphs with fixed valency, II.
Graphs Comb., 1988

1987
On distance-regular graphs with fixed valency.
Graphs Comb., 1987

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

1984
An Addition Formula for Hyperbolic Space.
J. Comb. Theory, Ser. A, 1984

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

1981
Nonexistence of certain distance-transitive digraphs.
J. Comb. Theory, Ser. B, 1981

Regular graphs with excess one.
Discret. Math., 1981

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

1980
How many P-polynomial Structures can an Association Scheme have?
Eur. J. Comb., 1980

On the Weight Distribution of Spherical t-designs.
Eur. J. Comb., 1980

1979
On the spectra of certain distance-regular graphs.
J. Comb. Theory, Ser. B, 1979

On Some Spherical t-Designs.
J. Comb. Theory, Ser. A, 1979

On Tight Spherical Designs.
J. Comb. Theory, Ser. A, 1979

1977
On Perfect Codes in the Hamming Schemes H(n, q) with q Arbitrary.
J. Comb. Theory, Ser. A, 1977

Examples of groups which have a graphical regular representation.
Discret. Math., 1977


  Loading...