Related papers: Remarks on low weight codewords of generalized aff…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
The paper proposes to decode Reed-Muller (RM) codes by projecting onto only a few subspaces such that the number of projections is significantly reduced. It reveals that the probability that error pairs are canceled simultaneously in two…
Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner graphs, on…
We focus on a branch of region-based spatial logics dealing with affine geometry. The research on this topic is scarce: only a handful of papers investigate such systems, mostly in the case of the real plane. Our long-term goal is to…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…
Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance. However, their practical instantiation encounters a first barrier due to…
We define almost affine vector rank-metric codes as subsets $\mathcal{C}\subseteq \mathbb{F}_{q^m}^n$ whose canonical projections have cardinalities that are powers of $q^m$, and prove that they naturally induce $q$-matroids. We establish…
Under polynomial time reduction, the maximum likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is…
The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized Reed-Muller code over $\gf(q)$ in the literature. The major objective of this paper is to present another generalization of the punctured…
A recent paper showed how to find sets of finite affine or projective planes constructed on a common set of points, so that lines of one plane meet lines of a different plane in at most two points. In this paper, those results are…
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…
The two-point functions in affine current algebras based on simple Lie algebras are constructed for all representations, integrable or non-integrable. The weight of the conjugate field to a primary field of arbitrary weight is immediately…
Let $T_n(q)$ be the ring of lower triangular matrices of order $n \geq 2$ with entries from the finite field $F(q)$ of order $q \geq 2$ and let ${^2T_n(q)}$ denote its free left module. For $n=2,3$ it is shown that the projective line over…
We endow the set of complements of a fixed subspace of a projective space with the structure of an affine space, and show that certain lines of such an affine space are affine reguli or cones over affine reguli. Moreover, we apply our…
We study the small weight codewords of the functional code C_2(Q), with Q a non-singular quadric of PG(N,q). We prove that the small weight codewords correspond to the intersections of Q with the singular quadrics of PG(N,q) consisting of…
We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG…
In this article, we give the answer to the following question: Given a field $\mathbb{F}$, finite subsets $A_1,\dots,A_m$ of $\mathbb{F}$, and $r$ linearly independent polynomials $f_1,\dots,f_r \in \mathbb{F}[x_1,\dots,x_m]$ of total…