The ability of a linear error-correcting code to recover erasures is connected to
influences of particular monotone Boolean functions. These functions provide insight
into the role that particular coordinates play in a code’s erasure repair capability.
We consider directly the influences of coordinates of a code. We describe a
family of codes, called codes with minimum disjoint support, for which all
influences may be determined. As a consequence, we find influences of repetition
codes and certain distinct weight codes. Computing influences is typically
circumvented by appealing to the transitivity of the automorphism group of
the code. Some of the codes considered here fail to meet the transitivity
conditions required for these standard approaches, yet we can compute them
directly.
PDF Access Denied
We have not been able to recognize your IP address
216.73.217.68
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.