Two-weight codes, graphs and orthogonal arrays
From MaRDI portal
(Redirected from Publication:285232)
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1633834 (Why is no real title available?)
- scientific article; zbMATH DE number 3664952 (Why is no real title available?)
- scientific article; zbMATH DE number 1236965 (Why is no real title available?)
- scientific article; zbMATH DE number 774344 (Why is no real title available?)
- A course in combinatorics.
- A metric for codes over residue class rings
- Characterization of finite Frobenius rings
- Duality for modules over finite rings and applications to coding theory
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- New bounds for codes over finite Frobenius rings
- Orthogonal arrays. Theory and applications
- Partial difference sets
- Partial spreads over \({\mathbb{Z}}_ q\)
- Properties of codes with two homogeneous weights
- Relative one-weight linear codes
- Ring geometries, two-weight codes, and strongly regular graphs
- The CRC handbook of combinatorial designs
- The Geometry of Two-Weight Codes
- Weighted modules and representations of codes
- Weights of linear codes and strongly regular normed spaces
Cited in
(6)- Some two-weight codes over chain rings and their strongly regular graphs
- Ring geometries, two-weight codes, and strongly regular graphs
- scientific article; zbMATH DE number 6260122 (Why is no real title available?)
- Construction of balanced sliced orthogonal arrays
- Density of free modules over finite chain rings
- 2-D quasi m-arrays and Gold code arrays
This page was built for publication: Two-weight codes, graphs and orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285232)