Related papers: Self-Orthogonal Codes from Vectorial Dual-Bent Fun…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
Locally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary…
In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AOD), with an aim to facilitate the construction of power-balanced orthogonal spacetime block codes (O-STBC) with favorable practical attributes. We…
Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…
In this paper, an algorithm for construction of multiple sets of two dimensional (2D) or matrix unipolar (optical) orthogonal codes has been proposed. Representations of these 2D codes in difference of positions representation (DoPR) have…
Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,\delta)$-locality that achieve the equality in the Singleton-type…
There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…
In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…
Let $\mathcal{R}_{e,m}$ be a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 2,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
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…
This paper contributes to construct double circulant self-dual codes by sextic cyclotomy. Generator matrixes of a family of pure double circulant codes and a family of double circulant codes with boundary are formed from sextic cyclotomic…
There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal…
We study orthogonal polynomials for a weight function defined over a domain of revolution, where the domain is formed from rotating a two-dimensional region and goes beyond the quadratic domains. Explicit constructions of orthogonal bases…
A $\mathbb{D}$-semi-classical weight is one which satisfies a particular linear, first order homogeneous equation in a divided-difference operator $\mathbb{D}$. It is known that the system of polynomials, orthogonal with respect to this…
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…
Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…