There is a local ring I of order 4, without identity for the multiplication, defined by generators and relations asWe give a natural map between linear codes over I and additive codes over 4 , that allows for efficient computations. We study the algebraic structure of linear codes over this non-unital local ring, their generator and parity-check matrices. A canonical form for these matrices is given in the case of so-called nice codes. By analogy with ℤ 4 -codes, we define residue and torsion codes attached to a linear I-code. We introduce the notion of quasi self-dual codes (QSD) over I, and Type IV I-codes, that is, QSD codes all codewords of which have even Hamming weight. This is the natural analogue of Type IV codes over the field 4 . Further, we define quasi Type IV codes over I as those QSD codes with an even torsion code. We give a mass formula for QSD codes, and another for quasi Type IV codes, and classify both types of codes, up to coordinate permutation equivalence, in short lengths.
There is a special local ring [Formula: see text] of order [Formula: see text] without identity for the multiplication, defined by [Formula: see text] We study the algebraic structure of linear codes over that non-commutative local ring, in particular their residue and torsion codes. We introduce the notion of quasi self-dual codes over [Formula: see text] and Type IV codes, that is quasi self-dual codes whose all codewords have even Hamming weight. We study the weight enumerators of these codes by means of invariant theory, and classify them in short lengths.
Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants. The dealer divides the secret into several pieces ( the shares), and one share is given to each participant. The secret can be recovered once a subset of the participants (a coalition) shares their information. In this paper, we present a new multisecret-sharing scheme inspired by Blakley's method based on hyperplanes intersection but adapted to a coding theoretic situation. Unique recovery requires the use of linear complementary (LCD) codes, that is, codes in which intersection with their duals is trivial. For a given code length and dimension, our system allows dealing with larger secrets and more users than other code-based schemes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.