Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Zengti Li, Eiichi Bannai, Etsuko Bannai. Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. Graphs and Combinatorics, 30(1):203-227, 2014. [doi]

The following publications are possibly variants of this publication:

On the existence of tight relative 2-designs on binary Hamming association schemesEiichi Bannai, Etsuko Bannai, Hideo Bannai. DM, 314:17-37, 2014. [doi]

Relative t-designs in binary Hamming association scheme H(n, 2)Eiichi Bannai, Etsuko Bannai, Yan Zhu. dcc, 84(1-2):23-53, 2017. [doi]

On optimal tight 4-designs on 2 concentric spheresEiichi Bannai, Etsuko Bannai. ejc, 27(2):179-192, 2006. [doi]

Tight relative 2-designs on two shells in Johnson association schemesYan Zhu, Eiichi Bannai, Etsuko Bannai. DM, 339(2):957-973, 2016. [doi]

New examples of Euclidean tight 4-designsEtsuko Bannai. ejc, 30(3):655-667, 2009. [doi]

A Study on the Issue of Chinese Character in Ruby on Rails and Relevant Solving SchemeYing Li. ccsecis, 1(1):33-35, 2008. [doi]

runs on WebDSL