Related papers: A Circulant Approach to Skew-Constacyclic Codes
Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a semi-linear map…
This paper focuses on controlling the absorbing set spectrum for a class of regular LDPC codes known as separable, circulant-based (SCB) codes. For a specified circulant matrix, SCB codes all share a common mother matrix, examples of which…
Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…
Hexagonal circle patterns with constant intersection angles are introduced and studied. It is shown that they are described by discrete integrable systems of Toda type. Conformally symmetric patterns are classified. Circle pattern analogs…
Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…
Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
We present an iterative technique to obtain skew-orthogonal polynomials with quartic weight, arising in the study of symplectic ensembles of random matrices.
In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 and received some attention more recently, there have not been many studies on polycyclic codes. This paper presents an…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with…
We derive an expression for the product of the Pfaffians of two skew-symmetric matrices A and B as a sum of products of the traces of powers of AB and an expression for the inverse matrix A$^{-1}$, or equivalently B$^{-1}$, as a…
We investigate deformations of skew group algebras that arise from a finite cyclic group acting on a polynomial ring in positive characteristic, where characteristic divides the order of the group. We allow deformations which deform both…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…
We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes…