Related papers: Minimal Binary Abelian Codes of length $p^m q^n$
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 propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…
A binary code Enc$:\{0,1\}^k \to \{0,1\}^n$ is $(0.5-\epsilon,L)$-list decodable if for all $w \in \{0,1\}^n$, the set List$(w)$ of all messages $m \in \{0,1\}^k$ such that the relative Hamming distance between Enc$(m)$ and $w$ is at most…
A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition…
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We construct MWS codes from quasi-minimal codes, thus obtaining of…
We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…
Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined. The weight definition of a pseudocodeword on the AWGN channel is also extended to two-dimensional q-ary…
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…
The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…
J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchical posets of two levels. At the end of their paper, they left…
In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
A cyclic codes of length $n$ over the rings $Z_{2^{m}}$ of integer of modulo $2^{m}$ is a linear code with property that if the codeword $(c_0,c_1,...,c_{n-1})\in \mathcal{C}$ then the cyclic shift $(c_1,c_2,...,c_0)\in \mathcal{C}$.…
We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…
A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…
For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…
We give one more proof of the first linear programming bound for binary codes, following the line of work initiated by Friedman and Tillich. The new argument is somewhat similar to previous proofs, but we believe it to be both simpler and…