Related papers: Optimal Narain CFTs from Codes
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters…
Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as…
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of $A^n$, where $A$ is an arbitrary finite set. Three classes of…
There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…
The research of developing a general methodology for the construction of good nonregular designs has been very active in the last decade. Recent research by Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they…
Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
We continue the program [1] of carving out the space of large $N$ confining gauge theories by modern S-matrix bootstrap methods, with the ultimate goal of cornering large $N$ QCD. In this paper, we focus on the effective field theory of…
The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…
In this paper the ensemble of codes formed by a serial concatenation of a repetition code with multiple accumulators connected through random interleavers is considered. Based on finite length weight enumerators for these codes, asymptotic…
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…
We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…
Codes arising from algebraic structures over number fields lead naturally to determinant optimization problems governed by arithmetic invariants. In this paper, we investigate $2\times 2$ space-time block codes defined over rings of…
In this long overdue second installment, we continue to develop the conformal bootstrap program for ${\mathcal N}=4$ superconformal field theories in four dimensions via an analysis of the correlation function of four stress-tensor…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…