Results 31 to 40 of about 29,101,112 (306)
Performance and structure of single-mode bosonic codes [PDF]
, 2017 The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals.
Victor V. Albert +11 more
semanticscholar +1 more source
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Information, 2018 Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type I codes and Type II codes, as well as shadow codes. In this paper, we provide a comprehensive description of extremal and near-extremal Type I codes over
Sunghyu Han
doaj +1 more source
New class of quantum error-correcting codes for a bosonic mode [PDF]
, 2016 We construct a new class of quantum error-correcting codes for a bosonic mode which are advantageous for applications in quantum memories, communication, and scalable computation.
M. Michael +6 more
semanticscholar +1 more source
Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication [PDF]
Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2018 Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector and matrix-matrix multiplication operations that need to be parallelized across multiple nodes.
Ankur Mallick +2 more
semanticscholar +1 more source
IEEE Transactions on Quantum Engineering, 2021 Quantum code construction from two classical codes $D_1[n,k_1,d_1]$ and $D_2[n,k_2,d_2]$ over the field $\mathbb {F}_{p^m}$ ($p$ is prime and $m$ is an integer) satisfying the dual containing criteria $D_1^{\perp } \subset D_2$ using the Calderbank ...
Priya Nadkarni, Shayan Garani
doaj +1 more source
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes [PDF]
, 2011 The study of minimal codewords in linear codes was motivated by Massey who described how minimal codewords of a linear code define access structures for secret sharing schemes.
Klein, Andreas, Storme, Leo
core +2 more sources
Quantum codes from $ \sigma $-dual-containing constacyclic codes over $ \mathfrak{R}_{l, k} $
AIMS Mathematics, 2023 Let $ \mathfrak{R}_{l, k} = {\mathbb F}_{p^m}[u_1, u_2, \cdots, u_k]/ \langle u_{i}^{l} = u_{i}, u_iu_j = u_ju_i = 0 \rangle $, where $ p $ is a prime, $ l $ is a positive integer, $ (l-1)\mid(p-1) $ and $ 1\leq i, j\leq k $. First, we define a Gray map $
Xiying Zheng, Bo Kong, Yao Yu
doaj +1 more source
Non-Binary LDPC Codes with Large Alphabet Size
, 2014 We study LDPC codes for the channel with input ${x}\in \mathbb{F}_q^m$ and output ${y}={x}+{z}\in \mathbb{F}_q^m$. The aim of this paper is to evaluate decoding performance of $q^m$-ary non-binary LDPC codes for large $m$.
Kasai, Kenta +2 more
core +1 more source
Codes over $ \frak m $-adic completion rings
Advances in Mathematics of Communications, 2022 <p style='text-indent:20px;'>The theory of linear codes over finite rings has been generalized to linear codes over infinite rings in two special cases; the ring of <inline-formula><tex-math id="M2">\begin{document}$ p $\end{document}</tex-math></inline-formula>-adic integers and formal power series ring.
Mahmoudi, Saadoun, Samei, Karim
openaire +2 more sources
Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes [PDF]
IEEE Transactions on Information Theory, 2018 Multishot network coding is considered in a worst-case adversarial setting in which an omniscient adversary with unbounded computational resources may inject erroneous packets in up to $t$ links, erase up to $\rho $ packets, and wire-tap up to $\mu $
Umberto Martínez-Peñas, F. Kschischang
semanticscholar +1 more source