An Infinite Family of Steiner Systems from Cyclic Codes

DOI10.1002/jcd.21565zbMath1391.05057arXiv1701.05965OpenAlexW2964272634MaRDI QIDQ4642161

Cunsheng Ding

Publication date: 22 May 2018

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.05965

zbMATH Keywords

linear code\(t\)-designSteiner systemcyclc code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Triple systems (05B07)

Related Items (12)

A class of affine-invariant codes and their support 2-designs ⋮ Another generalisation of the binary Reed-Muller codes and its applications ⋮ An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\) ⋮ Some \(t\)-designs from BCH codes ⋮ Infinite families of 2-designs from a class of affine-invariant codes ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Infinite families of 2‐designs derived from affine‐invariant codes ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Constructions of cyclic codes and extended primitive cyclic codes with their applications ⋮ Combinatorial \(t\)-designs from special functions ⋮ Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)

This page was built for publication: An Infinite Family of Steiner Systems from Cyclic Codes