Steiner triple systems S(2 m − 1, 3, 2) of rank 2 m − m+ 1 over $$\mathbb{F}

Steiner triple systems S(2 m − 1, 3, 2) of rank 2 m − m+ 1 over $$\mathbb{F}_2$$

Published:2012-04 Issue:2 Volume:48 Page:102-126
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Zinoviev V. A.,Zinoviev D. V.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946012020020.pdf

Reference18 articles.

1. Hanani, H., On Quadruple Systems, Canad. J. Math., 1960, vol. 12, pp. 145–157.

2. Lindner, C.C. and Rosa, A., Steiner Quadruple Systems-A Survey, Discrete Math., 1978, vol. 22, no. 2, pp. 147–181.

3. Hartman, A. and Phelps, K.T., Steiner Quadruple Systems, Contemporary Design Theory: A Collection of Surveys, ch. 6, Dinitz, J.H. and Stinson, D.R., Eds., New York: Wiley, 1992, pp. 205–240.

4. The CRC Handbook of Combinatorial Designs, Colbourn, C.J. and Dinitz, J.H., Eds., Boca Raton: CRC Press, 1996.

5. Tonchev, V.D., A Mass Formula for Steiner Triple Systems STS(2n − 1) of Rank 2n − n, J. Combin. Theory, Ser. A, 2001, vol. 95, no. 2, pp. 197–208.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The projective general linear group $${\mathrm {PGL}}(2,2^m)$$ and linear codes of length $$2^m+1$$;Designs, Codes and Cryptography;2021-05-21

2. On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences;IEEE Transactions on Information Theory;2021

3. The number of the non-full-rank Steiner quadruple systems S(v,4,3);Discrete Mathematics;2020-06

4. Linear codes of 2-designs associated with subcodes of the ternary generalized Reed–Muller codes;Designs, Codes and Cryptography;2019-12-11

5. The number of the non‐full‐rank Steiner triple systems;Journal of Combinatorial Designs;2019-08