Related papers: Properties of Codes with Two Homogeneous Weights
Davies efficient covering theorem states that an arbitrary measurable set $W$ in the plane can be covered by full lines so that the measure of the union of the lines has the same measure as $W$. This result has an interesting dual…
We propose a linear version of the weighted bounded negativity conjecture. It considers a smooth projective surface $X$ over an algebraically closed field of characteristic zero and predicts the existence of a common lower bound on…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…
Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular t-partite hypergraphs whose minimum distance improves earlier estimates…
We show that there exist real numbers $\alpha_1,\alpha_2$ linearly independent over $\mathbb{Z}$ together with 1 such that for every non-zero integer vector $(m_1,m_2)$ with $m_1\ge 0$ and $m_2\ge 0$ one has $||m_1\alpha_1+m_2\alpha_2|| \ge…
The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon codes, and Reed-Muller codes have nice decoding algorithms.…
Suppose F=W(k)[1/p] where W(k) is the ring of Witt vectors with coefficients in algebraically closed field k of characteristic p>2. We construct integral theory of p-adic semi-stable representations of the absolute Galois group of F with…
Tsfasman-Boguslavsky Conjecture predicts the maximum number of zeros that a system of linearly independent homogeneous polynomials of the same positive degree with coefficients in a finite field can have in the corresponding projective…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
We introduce a code construction for Wess-Zumino-Witten (WZW) models associated with simply-laced affine Lie algebras at level 1. The chiral primary fields of these rational CFTs can be parametrized by the elements of the outer automorphism…
There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts…
For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…
Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of methods to construct linear codes, one of which is based on…