Zobrazeno 1 - 10
of 115
pro vyhledávání: '"94b99"'
Autor:
Harned, Milena, Konda, Pranav Venkata, Liu, Felix Shanglin, Mudumbi, Nikhil, Shao, Eric Yuang, Xiao, Zheheng
Error-correcting codes for quantum computing are crucial to address the fundamental problem of communication in the presence of noise and imperfections. Audoux used Khovanov homology to define families of quantum error-correcting codes with desirable
Externí odkaz:
http://arxiv.org/abs/2410.11252
The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the a
Externí odkaz:
http://arxiv.org/abs/2408.10743
Autor:
Hawtin, Daniel R., Praeger, Cheryl E.
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group acting on
Externí odkaz:
http://arxiv.org/abs/2407.09803
Flag codes have received a lot of attention due to its application in random network coding. In 2021, Alonso-Gonz\'{a}lez et al. constructed optimal $(n,\mathcal{A})$-Optimum distance flag codes(ODFC) for $\mathcal {A}\subseteq \{1,2,\ldots,k,n-k,\ld
Externí odkaz:
http://arxiv.org/abs/2310.11285
Autor:
Agrawal, Astha, Sharma, R. K.
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal elements
Externí odkaz:
http://arxiv.org/abs/2310.08074
Publikováno v:
IEEE Trans. Inf. Theory 69(9) 2023, 5597-5603
The Galois ring GR$(4^\Delta)$ is the residue ring $Z_4[x]/(h(x))$, where $h(x)$ is a basic primitive polynomial of degree $\Delta$ over $Z_4$. For any odd $\Delta$ larger than $1$, we construct a partition of GR$(4^\Delta) \backslash \{0\}$ into $6$
Externí odkaz:
http://arxiv.org/abs/2305.02735
The bee-identification problem, formally defined by Tandon, Tan and Varshney (2019), requires the receiver to identify "bees" using a set of unordered noisy measurements. In this previous work, Tandon, Tan, and Varshney studied error exponents and sh
Externí odkaz:
http://arxiv.org/abs/2212.09952
Autor:
Zhang, Jun-Yang
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such that ever
Externí odkaz:
http://arxiv.org/abs/2210.03336
Transmit a codeword $x$, that belongs to an $(\ell-1)$-deletion-correcting code of length $n$, over a $t$-deletion channel for some $1\le \ell\le t
Externí odkaz:
http://arxiv.org/abs/2111.04255
Autor:
Ball, Simeon, Dixon, James
We present a polynomial time reduction from the multi-graph isomorphism problem to the problem of code equivalence of additive codes over finite extensions of ${\mathbb F}_2$.
Externí odkaz:
http://arxiv.org/abs/2108.13683