Related papers: Minimal Ternary Linear Codes from Vectorial Functi…
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…
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
It is well-known that few-weight linear codes have better applications in secret sharing schemes \cite{JY2006,CC2005}.In particular, projective two-weight codes are very precious as they are closely related to finite projective spaces,…
The study of constant-weight codes in $\ell_1$-metric was motivated by the duplication-correcting problem for data storage in live DNA. It is interesting to determine the maximum size of a code given the length $n$, weight $w$, minimum…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
A weighing matrix $W$ of order $n=\frac{p^{m+1}-1}{p-1}$ and weight $p^m$ is constructed and shown that the rows of $W$ and $-W$ form optimal constant weight ternary codes of length $n$, weight $p^m$ and minimum distance…
Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. Inspired by…
We characterize linear lexicographic $p$-ary codes. Using this characterization, when $p \ge 3$, we determine the dimensions of linear lexicographic codes obtained from several bases including the standard basis, except for those of certain…
In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural…
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…
Using techniques and results from Kudekar et al. we strengthen the bounds on the weight distribution of linear codes achieving capacity on the BEC, which were shown by the first author. In particular, we show that for any doubly transitive…
Linear codes with few weights have applications in data storage systems, secret sharing schemes, and authentication codes. In this paper, some kinds of p-ary linear codes with few weights are constructed by use of the given de ning set,…
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…
We consider rate R = k/n causal linear codes that map a sequence of k-dimensional binary vectors {b_t} to a sequence of n-dimensional binary vectors {c_t}, such that each c_t is a function of {b_1,b_2,...,b_t}. Such a code is called anytime…
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…