Two-weight codes, graphs and orthogonal arrays

DOI10.1007/s10623-015-0042-1zbMath1336.05148OpenAlexW610161529MaRDI QIDQ285232

Eimear Byrne, Alison Sneyd

Publication date: 19 May 2016

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

Full work available at URL: http://hdl.handle.net/10197/6304

zbMATH Keywords

strongly regular graphorthogonal arrayhomogeneous weightfinite Frobenius ringmodular codering-linear codetwo-weight code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Other types of codes (94B60) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial codes (94B25)

Related Items

Density of free modules over finite chain rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of codes with two homogeneous weights
• Partial difference sets
• Ring geometries, two-weight codes, and strongly regular graphs
• Partial spreads over \({\mathbb{Z}}_ q\)
• A metric for codes over residue class rings
• Orthogonal arrays. Theory and applications
• Weighted modules and representations of codes
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Relative one-weight linear codes
• Weights of linear codes and strongly regular normed spaces
• New bounds for codes over finite Frobenius rings
• The Geometry of Two-Weight Codes
• Duality for modules over finite rings and applications to coding theory
• Characterization of finite Frobenius rings