Results 21 to 30 of about 1,807,959 (233)
Multi-CRC Polar Codes and M-SCFlip-Based Decoding
IEEE Access, 2019 A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes.
Rui Guo, Kangni Chen, Huaping Liu
doaj +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
Fault-tolerant logical gates in quantum error-correcting codes [PDF]
, 2014 Recently, Bravyi and K\"onig have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes.
Pastawski, Fernando, Yoshida, Beni
core +3 more sources
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
Low Complexity Encoding for Network Codes [PDF]
, 2006 In this paper we consider the per-node run-time complexity of network multicast codes. We show that the randomized algebraic network code design algorithms described extensively in the literature result in codes that on average require a number of ...
Cassuto, Yuval +2 more
core +3 more sources
Narain CFTs from nonbinary stabilizer codes
Journal of High Energy Physics, 2023 We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ( F p m $$ {\mathbbm{F}}_{p^m} $$ with p prime and m ≥ 1) or
Yasin Ferdous Alam +4 more
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
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$
, 2011 Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal.
Krotov, Denis S. +2 more
core +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