Infinite families of 3-designs from a type of five-weight code

DOI10.1007/s10623-017-0352-6zbMath1426.94158arXiv1607.04815OpenAlexW2488283090MaRDI QIDQ2413018

Cunsheng Ding

Publication date: 6 April 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

linear codeweight distribution\(t\)-designcyclic code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (21)

Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes ⋮ Infinite families of 2-designs from a class of non-binary Kasami cyclic codes ⋮ A class of affine-invariant codes and their support 2-designs ⋮ Infinite families of 2-designs from linear codes ⋮ 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 \(t\)-designs and strongly regular graphs from punctured codes ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) ⋮ 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 ⋮ Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) ⋮ Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions ⋮ New infinite families of near MDS codes holding \(t\)-designs ⋮ Infinite families of 2‐designs from a class of cyclic codes ⋮ Combinatorial \(t\)-designs from special functions ⋮ Combinatorial \(t\)-designs from quadratic functions ⋮ Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros ⋮ Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\) ⋮ Linear codes from support designs of ternary cyclic codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• Codes and designs -- existence and uniqueness
• Quasi-symmetric designs, codes, quadrics, and hyperplane sections
• Designs in additive codes over GF(4)
• A coding theoretic approach to extending designs
• Steiner systems \(S(2,4,v)\) -- a survey
• The dimension and minimum distance of two classes of primitive BCH codes
• Parameters of Several Classes of BCH Codes
• The Bose and Minimum Distance of a Class of BCH Codes
• Fundamentals of Error-Correcting Codes
• Coding and Combinatorics

This page was built for publication: Infinite families of 3-designs from a type of five-weight code