相关论文: Narain CFTs and error-correcting codes on finite f…
Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…
It is recently shown that discrete $N\times N$ linear unitary operators can be represented by interlacing $N+1$ phase shift layers with a fixed intervening operator such as Discrete Fractional Fourier Transform (DFrFT). Here, we show that…
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…
We construct fermionic conformal field theories (CFTs) whose spectra are characterized by quantum stabilizer codes. We exploit our construction to search for fermionic CFTs with supersymmetry by focusing on quantum stabilizer codes of the…
In order to build a scalable quantum computer error correction will be required to reduce the impact of errors. Implementing error correction in the framework of measurement based computation manifests itself as the construction of fault…
We construct two-dimensional codes for correcting burst errors using the finite field Fourier transform. The encoding procedure is performed in the transformed domain using the conjugacy property of the finite field Fourier transform. The…
A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes…
Defects in conformal field theories are interesting objects to study from both formal and applied points of view. In this paper, we construct conformal defects in free scalar field CFTs in diverse dimensions. After discussing the possible…
We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes…
In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…
We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. While conventional constructions using circulant permutation matrices are limited to girth…
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…
We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus,…
Error-correcting codes are known to define chiral 2d lattice CFTs where all the $U(1)$ symmetries are enhanced to $SU(2)$. In this paper, we extend this construction to a broader class of length-$n$ codes which define full (non-chiral) CFTs…
In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic…
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…
The definition of polar codes given by Arikan is explicit, but the construction complexity is an issue. This is due to the exponential growth in the size of the output alphabet of the bit-channels as the codeword length increases. Tal and…
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…
We construct codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ with $u^2=0$. These code are designed for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the $GC$ content constraint and avoid…
In two-dimensional conformal field theory (CFT) the building blocks are given by chiral CFTs, i.e.~CFTs on the unit circle (compactified light-ray). They are generated by quantum fields depending on one light-ray coordinate only. There are…