Semi-Distance Codes and Steiner Systems

Author： Ito Hiro Kobayashi Midori Nakamura Gisaku

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.1, 2007-06, pp. : 283-290

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An Infinite Family of Steiner Systems $S (2, 4, 2^{m})$ from Cyclic Codes

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 26, Iss. 3, 2018-03 ,pp. : 127-144

John Wiley & Sons Inc

Access to resources Recommend Favorite

On distance nonregularity of Preparata codes

By Solov’eva F. Tokareva N.

Siberian Mathematical Journal, Vol. 48, Iss. 2, 2007-03 ,pp. : 327-333

Springer Publishing Company

Access to resources Recommend Favorite

On the Intersection Problem for Steiner Triple Systems of Different Orders

By Danziger Peter Dukes Peter Griggs Terry Mendelsohn Eric

Graphs and Combinatorics, Vol. 22, Iss. 3, 2006-11 ,pp. : 311-329

Springer Publishing Company

Access to resources Recommend Favorite

Colouring Cubic Graphs by Small Steiner Triple Systems

By Pál Dávid Škoviera Martin

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 217-228

Springer Publishing Company

Access to resources Recommend Favorite

Large Cross‐Free Sets in Steiner Triple Systems

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 23, Iss. 8, 2015-08 ,pp. : 321-327

John Wiley & Sons Inc

Access to resources Recommend Favorite