default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEiichi Bannai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j53]Eiichi Bannai, Tsuyoshi Miezaki
, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes II. Des. Codes Cryptogr. 91(7): 2509-2522 (2023)- [i2]Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some non-binary codes (a resume). CoRR abs/2309.08081 (2023) - 2022
- [j52]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials. Ars Math. Contemp. 22(2): 2 (2022) - [i1]Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes II. CoRR abs/2208.09077 (2022) - 2021
- [j51]Eiichi Bannai, Manabu Oura, Da Zhao:
The complex conjugate invariants of Clifford groups. Des. Codes Cryptogr. 89(2): 341-350 (2021) - 2020
- [j50]Eiichi Bannai, Da Zhao:
Spherical Embeddings of Symmetric Association Schemes in 3-Dimensional Euclidean Space. Graphs Comb. 36(2): 245-250 (2020)
2010 – 2019
- 2019
- [j49]Eiichi Bannai, Yan Zhu:
Tight t-designs on one shell of Johnson association schemes. Eur. J. Comb. 80: 23-36 (2019) - 2017
- [j48]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Kyoung-Tark Kim, Wei-Hsuan Yu:
On Spherical Designs of Some Harmonic Indices. Electron. J. Comb. 24(2): 2 (2017) - [j47]Eiichi Bannai, Etsuko Bannai, Yan Zhu:
Relative t-designs in binary Hamming association scheme H(n, 2). Des. Codes Cryptogr. 84(1-2): 23-53 (2017) - [j46]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. Graphs Comb. 33(1): 1-41 (2017) - [j45]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Takuya Ikuta, Kyoung-Tark Kim:
Harmonic Index Designs in Binary Hamming Schemes. Graphs Comb. 33(6): 1405-1418 (2017) - 2016
- [j44]Yan Zhu, Eiichi Bannai, Etsuko Bannai:
Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2): 957-973 (2016) - 2015
- [j43]Eiichi Bannai, Etsuko Bannai, Sho Suda, Hajime Tanaka:
On Relative $t$-Designs in Polynomial Association Schemes. Electron. J. Comb. 22(4): 4 (2015) - [j42]Eiichi Bannai, Takayuki Okuda, Makoto Tagami:
Spherical designs of harmonic index t. J. Approx. Theory 195: 1-18 (2015) - 2014
- [j41]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314: 17-37 (2014) - [j40]Zengti Li, Eiichi Bannai, Etsuko Bannai:
Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. Graphs Comb. 30(1): 203-227 (2014) - 2013
- [j39]Eiichi Bannai, Etsuko Bannai:
t-Designs with the number of blocks close to the Fisher type lower bound. J. Comb. Theory A 120(7): 1575-1577 (2013) - 2012
- [j38]Eiichi Bannai, Takahiro Sato, Junichi Shigezumi:
Maximal m-distance sets containing the representation of the Johnson graph J(n, m). Discret. Math. 312(22): 3283-3292 (2012) - 2010
- [j37]Eiichi Bannai, Etsuko Bannai, Masatake Hirao, Masanori Sawa:
Cubature formulas in numerical analysis and Euclidean tight designs. Eur. J. Comb. 31(2): 423-441 (2010)
2000 – 2009
- 2009
- [j36]Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka:
Finite Euclidean graphs and Ramanujan graphs. Discret. Math. 309(20): 6126-6134 (2009) - [j35]Eiichi Bannai, Etsuko Bannai:
A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Comb. 30(6): 1392-1425 (2009) - [j34]Kanat S. Abdukhalikov, Eiichi Bannai, Sho Suda:
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets. J. Comb. Theory A 116(2): 434-448 (2009) - 2008
- [j33]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 (2008) - 2007
- [j32]Eiichi Bannai, Etsuko Bannai, Djoko Suprijanto:
On the strong non-rigidity of certain tight Euclidean designs. Eur. J. Comb. 28(6): 1662-1680 (2007) - 2006
- [j31]Eiichi Bannai, Etsuko Bannai:
On primitive symmetric association schemes with m1=3. Contributions Discret. Math. 1(1) (2006) - [j30]Eiichi Bannai, Etsuko Bannai:
On optimal tight 4-designs on 2 concentric spheres. Eur. J. Comb. 27(2): 179-192 (2006) - 2005
- [j29]Eiichi Bannai, Etsuko Bannai:
A note on the spherical embeddings of strongly regular graphs. Eur. J. Comb. 26(8): 1177-1179 (2005) - 2004
- [j28]Christine Bachoc, Eiichi Bannai, Renaud Coulangeon:
Codes and designs in Grassmannian spaces. Discret. Math. 277(1-3): 15-28 (2004) - [j27]Eiichi Bannai, Willem H. Haemers, Patrick Solé:
Johan Jacob Seidel 1919-2001. Eur. J. Comb. 25(2): 145-146 (2004) - [j26]Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka:
Finite analogues of non-Euclidean spaces and Ramanujan graphs. Eur. J. Comb. 25(2): 243-259 (2004) - 2003
- [j25]Eiichi Bannai, Akihiro Munemasa, Sung-Yell Song, Paul M. Terwilliger:
Preface. Discret. Math. 264(1-3): 1 (2003)
1990 – 1999
- 1999
- [j24]Eiichi Bannai, Patrick Solé:
Introduction. Eur. J. Comb. 20(7): 605- (1999) - [j23]Eiichi Bannai, Etsuko Bannai, Michio Ozeki, Yasuo Teranishi:
On the Ring of Simultaneous Invariants for the Gleason-MacWilliams Group. Eur. J. Comb. 20(7): 619-627 (1999) - [j22]Eiichi Bannai, Steven T. Dougherty, Masaaki Harada, Manabu Oura:
Type II Codes, Even Unimodular Lattices, and Invariant Rings. IEEE Trans. Inf. Theory 45(4): 1194-1205 (1999) - 1993
- [j21]Eiichi Bannai, Sung Yell Song:
Character Tables of Fission Schemes and Fusion Schemes. Eur. J. Comb. 14(5): 385-396 (1993) - 1992
- [j20]Eiichi Bannai:
On a theorem of Ikuta, Ito and Munemasa. Eur. J. Comb. 13(1): 1-3 (1992) - 1990
- [j19]Eiichi Bannai, Shen Hao, Sung-Yell Song:
Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points. J. Comb. Theory A 54(2): 164-200 (1990)
1980 – 1989
- 1989
- [j18]Eiichi Bannai, Stuart G. Hoggar:
Tight t-Designs and Squarefree Integers. Eur. J. Comb. 10(2): 113-135 (1989) - [j17]Eiichi Bannai, Tatsuro Ito:
On Distance-regular Graphs with Fixed Valency, IV. Eur. J. Comb. 10(2): 137-148 (1989) - [j16]Eiichi Bannai, Sung-Yell Song:
On the character table of the association schemeSp(4, q)/Sz(q). Graphs Comb. 5(1): 291-293 (1989) - 1988
- [j15]Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency, II. Graphs Comb. 4(1): 219-228 (1988) - 1987
- [j14]Eiichi Bannai, Tatsuro Ito:
On distance-regular graphs with fixed valency. Graphs Comb. 3(1): 95-109 (1987) - 1986
- [j13]Eiichi Bannai, Tatsuro Ito:
Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I. Graphs Comb. 2(1): 287-308 (1986) - 1984
- [j12]Eiichi Bannai, Aart Blokhuis, J. J. Seidel, Philippe Delsarte:
An Addition Formula for Hyperbolic Space. J. Comb. Theory A 36(3): 332-341 (1984) - 1983
- [j11]Eiichi Bannai, Etsuko Bannai, Dennis Stanton:
An upper bound for the cardinality of an s-distance subset in real Euclidean space, II. Comb. 3(2): 147-152 (1983) - 1981
- [j10]Eiichi Bannai, Etsuko Bannai:
An upper bound for the cardinality of an s-distance subset in real Euclidean space. Comb. 1(2): 99-102 (1981) - [j9]Eiichi Bannai, Tatsuro Ito:
Regular graphs with excess one. Discret. Math. 37(2-3): 147-158 (1981) - [j8]Eiichi Bannai, Peter J. Cameron, Jeff Kahn:
Nonexistence of certain distance-transitive digraphs. J. Comb. Theory B 31(3): 105-110 (1981) - 1980
- [j7]Eiichi Bannai:
On the Weight Distribution of Spherical t-designs. Eur. J. Comb. 1(1): 19-26 (1980) - [j6]Eiichi Bannai, Etsuko Bannai:
How many P-polynomial Structures can an Association Scheme have? Eur. J. Comb. 1(4): 289-298 (1980)
1970 – 1979
- 1979
- [j5]Eiichi Bannai:
On Tight Spherical Designs. J. Comb. Theory A 26(1): 38-47 (1979) - [j4]Eiichi Bannai:
On Some Spherical t-Designs. J. Comb. Theory A 26(2): 157-161 (1979) - [j3]Eiichi Bannai, Tatsuro Ito:
On the spectra of certain distance-regular graphs. J. Comb. Theory B 27(3): 274-293 (1979) - 1977
- [j2]Eiichi Bannai:
Examples of groups which have a graphical regular representation. Discret. Math. 19(3): 287-288 (1977) - [j1]Eiichi Bannai:
On Perfect Codes in the Hamming Schemes H(n, q) with q Arbitrary. J. Comb. Theory A 23(1): 52-67 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
