Two-Weight Codes, Graphs and Orthogonal Arrays

Files in This Item:
 File SizeFormat
Downloadbyrne_sneyd_dcc.pdf335.34 kBAdobe PDF
Title: Two-Weight Codes, Graphs and Orthogonal Arrays
Authors: Byrne, EimearSneyd, Alison
Permanent link:
Date: 2015
Online since: 2016-01-16T04:00:18Z
Abstract: We investigate properties of two-weight codes over finite Frobenius rings, giving constructions for the modular case. A δ-modular code [15] is characterized as having a generator matrix where each column g appears with multiplicity δ|gR×| for some δ ∈ Q. Generalizing [10] and [5], we show that the additive group of a two-weight code satisfying certain constraint equations (and in particular a modular code) has a strongly regular Cayley graph and derive existence conditions on its parameters. We provide a construction for an infinite family of modular two-weight codes arising from unions of submodules with pairwise trivial intersection. The corresponding strongly regular graphs are isomorphic to graphs from orthogonal arrays.
Funding Details: Science Foundation Ireland
Type of material: Journal Article
Publisher: Springer
Journal: Designs Codes and Cryptography
Volume: 79
Issue: 2
Start page: 201
End page: 217
Copyright (published version): 2015 Springer
Keywords: Codes over ringsFinite Frobenius ringOrthogonal arrayStrongly regular graphTwo-weight codeHomogeneous weightModular codesRing-linear code
DOI: 10.1007/s10623-015-0042-1
Language: en
Status of Item: Peer reviewed
This item is made available under a Creative Commons License:
Appears in Collections:Mathematics and Statistics Research Collection

Show full item record

Page view(s)

Last Week
Last month
checked on Jul 2, 2022

Download(s) 50

checked on Jul 2, 2022

Google ScholarTM



If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.