Related papers: Product Construction of Affine Codes
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power $q$, we construct some class of linear code over finite field $\mathbb{F}_q$ with defining set be the preimage of…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
Binary embeddings provide efficient and powerful ways to perform operations on large scale data. However binary embedding typically requires long codes in order to preserve the discriminative power of the input space. Thus binary coding…
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…
A large family of periodic planar non-linear bimode metamaterials are constructed from rigid bars and pivots. They are affine materials in the sense that their macroscopic deformations are only affine deformations: at large distances any…
Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…
A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…
Some combinatorial designs, such as Hadamard matrices, have been extensively researched and are familiar to readers across the spectrum of Science and Engineering. They arise in diverse fields such as cryptography, communication theory, and…
We use a simple construction called `recursive subproducts' (that is known to yield good codes of lengths $n^m$, $n \geq 3$) to identify a family of codes sandwiched between first-order and second-order Reed-Muller (RM) codes. These codes…
We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.
Based on a generic construction, two classes of ternary three-weight linear codes are obtained from a family of power functions, including some APN power functions. The weight distributions of these linear codes are determined through…
This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…
In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal…