Related papers: Scalar products and Left LCD codes
A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes…
Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear…
The applications of additive codes mainly lie in quantum error correction and quantum computing. Due to their applications in quantum codes, additive codes have grown in importance. In addition to this, additive codes allow the…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral join complexes. Then we compute the universal algebra of polyhedral join complexes under certain split conditions and…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
We classify six-dimensional Lie groups which admit a left-invariant half-flat SU(3)-structure and which split in a direct product of three-dimensional factors. Moreover, a complete list of those direct products is obtained which admit a…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
We consider irregular product codes.In this class of codes, each codeword is represented by a matrix. The entries in each row (column) of the matrix should come from a component row (column) code. As opposed to (standard) product codes, we…
Let $F=\mathbb{F}_q$ and let $K=\mathbb{F}_{q^m}$ be a finite extension. An additive left group code is a left $FG$-submodule of the group algebra $KG$. In this paper, we introduce projector additive left group codes and restricted…
We give a simple construction of codes from left ideals in group algebras of certain dihedral groups and give an example to show that they can produce codes with weights equal to those of the best known codes of the same length.
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…
This paper considers a new alphabet set, which is a ring that we call $\mathbb{F}_4R$, to construct linear error-control codes. Skew cyclic codes over the ring are then investigated in details. We define a nondegenerate inner product and…
Recently, Linear Complementary Dual (LCD) codes have garnered substantial interest within coding theory research due to their diverse applications and favorable attributes. This paper directs its attention to the construction of binary and…
We define a metric ultraproduct of topological groups with left-invariant metric, and show that there is a countable sequence of finite groups with left-invariant metric whose metric ultraproduct contains isometrically as a subgroup every…
An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix…
This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…
Linear complementary dual (LCD) codes introduced by Massey are the codes whose intersections with their dual codes are trivial. It can help to improve the security of the information processed by sensitive devices, especially against…