Related papers: Narain CFTs and error-correcting codes on finite f…
In this work, we study linear error-correcting codes against adversarial insertion-deletion (insdel) errors, a topic that has recently gained a lot of attention. We construct linear codes over $\mathbb{F}_q$, for…
Error-correcting codes are usually envisioned to counter errors by operating unitary corrections depending on the projective measurement results of some syndrome observables. We here propose a way to use them in a more integrated way, where…
Charged point defects in materials are widely studied using Density Functional Theory (DFT) packages with periodic boundary conditions. The formation energy and defect level computed from these simulations need to be corrected to remove the…
In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…
Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…
We calculate formation probabilities of the ground state of the finite size quantum critical chains using conformal field theory (CFT) techniques. In particular, we calculate the formation probability of one interval in the finite open…
We apply the theory of harmonic analysis on the fundamental domain of $SL(2,\mathbb{Z})$ to partition functions of two-dimensional conformal field theories. We decompose the partition function of $c$ free bosons on a Narain lattice into…
Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from…
The interpretation of D-branes in terms of open strings has lead to much interest in boundary conditions of two-dimensional conformal field theories (CFTs). These studies have deepened our understanding of CFT and allowed us to develop new…
Nano-size objects like metal clusters present an ideal system for the study of quantum phenomena and for constructing practical quantum devices. Integrating these small objects in a macroscopic circuit is, however, a difficult task. So far…
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…
This is an invited contribution to the 2nd edition of the Encyclopedia of Mathematical Physics. We review the following algebraic structures which appear in two-dimensional conformal field theory (CFT): The symmetries of two-dimensional…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…
The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic 1+1D CFT codes under extensive local dephasing…
We study the properties of 2+1d conformal field theories (CFTs) in a background magnetic field. Using generalized particle-vortex duality, we argue that in many cases of interest the theory becomes gapped, which allows us to make a number…
The finite field multiplier is mainly used in many of today's state of the art digital systems and its hardware implementation for bit parallel operation may require millions of logic gates. Natural causes or soft errors in digital design…
We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.