An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)

DOI10.1023/A:1027338603957zbMath1054.94015OpenAlexW1497223756MaRDI QIDQ1431625

P. Vijay Kumar, Dong-Joon Shin, Tor Helleseth

Publication date: 11 June 2004

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

Full work available at URL: https://doi.org/10.1023/a:1027338603957

zbMATH Keywords

Assmus-Mattson theoremcomplete weight enumeratort-designs\(Z_4\) codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Finite ground fields in algebraic geometry (14G15) Combinatorial structures in finite projective spaces (51E20)

Related Items (5)

Weighted subspace designs from \(q\)-polymatroids ⋮ Association schemes related to Delsarte-Goethals codes ⋮ An Assmus-Mattson theorem for codes over commutative association schemes ⋮ An Assmus--Mattson Theorem for Rank Metric Codes ⋮ A simple proof to the minimum distance of \(\mathbb{Z}_{4}\)-linear Goethals-like codes

This page was built for publication: An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)