Related papers: On the Algebraic Structure Underlying the Support …
In this work, we define a modification of a bordered construction for self-dual codes which utilises $\lambda$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
We study the functional codes $C_2(X)$ defined on a projective variety $X$, in the case where $X \subset {\mathbb{P}}^3$ is a non-degenerate hermitian surface. We first give some bounds for $# X_{Z(\mathcal{Q})}(\mathbb{F}_{q})$, which are…
We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random…
Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
The structure of S-duality in U(1) gauge theory on a 4-manifold M is examined using the formalism of noncommutative geometry. A noncommutative space is constructed from the algebra of Wilson-'t Hooft line operators which encodes both the…
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive…
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…
We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
The duals of cyclic codes with two zeros have been extensively studied, and their weight distributions have recently been evaluated in some cases. In this note, we determine the weight distribution of a certain new class of such codes by…
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In…
The codeword stabilized (CWS) quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021 [quant-ph]), but only for binary states. Here we generalize the CWS…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of…
We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of…