scientific article; zbMATH DE number 2081128

zbMath1057.94028MaRDI QIDQ4474246

T. Aaron Gulliver, Manish K. Gupta, David G. Glynn

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2227/22270112.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear codesweight distributionbinary simplex codeChinese product-type construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (4)

Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) ⋮ Simplex and MacDonald codes over \(R_q\) ⋮ On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance ⋮ Unnamed Item

This page was built for publication: