Related papers: Trace representation and linear complexity of bina…

The linear-programming decoding performance of a binary linear code crucially depends on the structure of the fundamental cone of the parity-check matrix that describes the code. Towards a better understanding of fundamental cones and the…

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

In this paper, the linear complexity over $\mathbf{GF}(r)$ of generalized cyclotomic quaternary sequences with period $2pq$ is determined, where $ r $ is an odd prime such that $r \ge 5$ and $r\notin \lbrace p,q\rbrace$. The minimal value…

Traditional global stability measure for sequences is hard to determine because of large search space. We propose the $k$-error linear complexity with a zone restriction for measuring the local stability of sequences. Accordingly, we can…

A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…

We construct explicitly some analytic families of etale (phi,Gamma)-modules, which give rise to analytic families of 2-dimensional crystalline representations. As an application of our constructions, we verify some conjectures of Breuil on…

We investigate the $k$-error linear complexity over $\mathbb{F}_p$ of binary sequences of length $2p$ with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method…

For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…

An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The…

Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the…

We derive an expression for the product of the Pfaffians of two skew-symmetric matrices A and B as a sum of products of the traces of powers of AB and an expression for the inverse matrix A$^{-1}$, or equivalently B$^{-1}$, as a…

Let $p$ be a prime number and $F$ a local field with residual characteristic $p$. In this article, to an irreducible smooth representation of $GL_2(F)$ over $\bar{\mathbf{F}}_p$ with central character, we associate canonically a diagram…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

For $f : \mathbb{N} \to \{0,\pm 1\}$ the $f$-signed partition numbers $\mathfrak{p}(n,f)$ are defined to be the weighted partition sums \[ \mathfrak{p}(n,f) = \sum_{\substack{x_{1}+\cdots+x_{k} = n \\ x_{1} \geq \cdots \geq x_{k} > 0 \\ k…

We present a binary tree that describes the 2-adic valuation of a sequence of coefficients arising from the evaluation of a rational integral.

We show that the generating series of traces of reciprocal singular moduli is a mixed mock modular form of weight $3/2$ whose shadow is given by a linear combination of products of unary and binary theta functions. To prove these results,…

It is well known that, given \(b\ge 0\), finding an $(a,b)$-trapping set with the minimum \(a\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem can be solved with linear complexity with respect to the…