Results 31 to 40 of about 29,686,764 (312)
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
A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes
IEEE Access, 2020 Let R = Fq + uFq + vFq + uvFq, with u2 = u, v2 = v, uv = vu, where q = pm for a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr -
Hai Q. Dinh +4 more
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
Turbo codes with rate-m/(m+1) constituent convolutional codes.
IEEE Trans. Commun., 2005 The original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel concatenation of two rate-1/2 binary recursive systematic convolutional (RSC) codes. This paper explains how replacing rate-1/2 binary component codes by rate-m/(m + 1) binary RSC codes can lead to better global performance.
Douillard, Catherine, Berrou, Claude
openaire +2 more sources
Compute-and-Forward: Harnessing Interference Through Structured Codes [PDF]
IEEE Transactions on Information Theory, 2009 Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that
B. Nazer, M. Gastpar
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
Flexible Multilevel Coding with Concatenated Polar-Staircase Codes for M-QAM [PDF]
IEEE Transactions on Communications, 2020 In this work, a multilevel coding (MLC) based coded modulation scheme with two degrees of freedom in rate flexibility is proposed and compared with a bit-interleaved coded modulation (BICM) scheme from a performance versus complexity perspective. The proposed MLC scheme is based on a rate flexible inner soft-decision polar code and utilizes an outer ...
Tayyab Mehmood +3 more
openaire +2 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
Construction of q-ary(n,M,d)-codes in PG(2,16)
Wasit Journal for Pure Sciences, 2023 The goal of this paper was to study the applications of the projective plane PG (2, q) over a Galois field of order q in the projective q-ary (n, M, d) -code such that the parameters length of code n, the maximum value size code M, and the minimum ...
Dunya Fareeq Fendi +1 more
doaj +1 more source
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