Designs in additive codes over GF(4)

zbMath1035.94015MaRDI QIDQ1412248

Jon-Lark Kim, Vera S. Pless

Publication date: 10 November 2003

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

zbMATH Keywords

Assmus-Mattson theorem\(t\)-designadditive codes

Mathematics Subject Classification ID

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

Related Items (16)

Infinite families of 2-designs from linear codes ⋮ Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\) ⋮ Infinite families of 3-designs from a type of five-weight code ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) ⋮ On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes ⋮ Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions ⋮ An Assmus-Mattson theorem for codes over commutative association schemes ⋮ \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes ⋮ Parameters of 2-Designs from Some BCH Codes ⋮ Designs from subcode supports of linear codes ⋮ Combinatorial \(t\)-designs from quadratic functions ⋮ Unnamed Item ⋮ Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless

This page was built for publication: Designs in additive codes over GF(4)