Related papers: Performance Analysis of 3-Dimensional Turbo Codes
Discrete time crystals (DTCs) are nonequilibrium phases of matter with exotic observable dynamics. Among their remarkable features is their response to a periodic drive at a fraction of its frequency. Current successful experiments are…
Practical large-scale quantum computation requires both efficient error correction and robust implementation of logical operations. Three-dimensional (3D) color codes are a promising candidate for fault-tolerant quantum computation due to…
We introduce six independent trivariate bicycle (ITB) codes, which extend the bivariate bicycle framework of Bravyi et al.\ to three cyclic dimensions. Using asymmetric polynomial pairs on three-dimensional tori, we construct four codes…
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping…
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error…
Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short), with a "matched metric" $\delta_{r}$ called asymmetric…
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear…
An efficient scheme to increase the performance of polar codes at short and moderate block lengths is a concatenation of CRC code and a polar code. In order to obtain better result of the concatenation, a CRC code with best error control…
The effects of the odd-even constraint - as an interleaver design criterion - on the performance of rate-1/2 binary turbo codes are revisited. According to the current understanding, its adoption is favored because it makes the information…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…
Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…
Iterative processing is widely adopted nowadays in modern wireless receivers for advanced channel codes like turbo and LDPC codes. Extension of this principle with an additional iterative feedback loop to the demapping function has proven…
In this paper a discussion of the detailed operation of the interleavers used by the turbo codes defined on the telecommunications standards cdma2000 (3GPP2 C.S0024-B V2.0) and W-CDMA (3GPP TS 25.212 V7.4.0) is presented. Differences in the…
We investigate the asymptotic rates of length-$n$ binary codes with VC-dimension at most $dn$ and minimum distance at least $\delta n$. Two upper bounds are obtained, one as a simple corollary of a result by Haussler and the other via a…
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…
In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
The hull of a linear code over finite fields is the intersection of the code and its dual, and linear codes with small hulls have applications in computational complexity and information protection. Linear codes with the smallest hull are…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…
Unimodular sequences with good auto/cross-correlation properties are favorable in wireless communication and radar applications. In this paper, we focus on designing these kinds of sequences. The main content is as follows: first, we…