Related papers: Minimal codewords in Norm-Trace codes
In this paper, monic polynomials orthogonal with deformation of the Freud-type weight function are considered. These polynomials fullfill linear differential equation with some polynomial coefficients in their holonomic form. The aim of…
In this short note we prove a couple of facts about polynomial count varieties, answering natural questions that they raise. A polynomial count $X$ variety is essentially one for which its number of points over finite fields is given by a…
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.
Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…
The $p$-ary linear code $\mathcal C_{k}(n,q)$ is defined as the row space of the incidence matrix $A$ of $k$-spaces and points of $\text{PG}(n,q)$. It is known that if $q$ is square, a codeword of weight $q^k\sqrt{q}+\mathcal O \left(…
Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…
Let $\mathcal{H}$ be the Hermitian curve defined over a finite field $\mathbb{F}_{q^2}$. In this paper we complete the geometrical characterization of the supports of the minimum-weight codewords of the algebraic-geometry codes over…
We give simple deterministic reductions demonstrating the NP-hardness of approximating the nearest codeword problem and minimum distance problem within arbitrary constant factors (and almost-polynomial factors assuming NP cannot be solved…
In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…
An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…
The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
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…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more generally, affine Grassmann codes of a given level.…