Results 21 to 30 of about 1,184,577 (219)
Distributed MIMO coding scheme with low decoding complexity for future mobile TV broadcasting [PDF]
A novel distributed space-time block code (STBC) for the next generation mobile TV broadcasting is proposed. The new code provides efficient performance within a wide range of power imbalance showing strong adaptivity to the single frequency network (SFN)
Crussière, Matthieu +3 more
core +4 more sources
Irregular Vector Turbo Codes with low complexity
The term Block Turbo Code typically refers to the iterative decoding of a serially concatenated two-dimensional systematic block code. This paper introduces a Vector Turbo Code that is irregular but with code rates comparable to those of a Block Turbo ...
Abiodun O. Sholiyi, Timothy O’Farrell
doaj +1 more source
On cutting blocking sets and their codes [PDF]
AbstractLetPG(r,q){\operatorname{PG}(r,q)}be ther-dimensional projective space over the finite fieldGF(q){\operatorname{GF}(q)}. A set𝒳{\mathcal{X}}of points ofPG(r,q){\operatorname{PG}(r,q)}is a cutting blocking set if for each hyperplane Π ofPG(r,q){\operatorname{PG}(r,q)}the setΠ∩𝒳{\Pi\cap\mathcal{X}}spans Π.
Bartoli, Daniele +3 more
openaire +6 more sources
System Performance of Concatenated STBC and Block Turbo Codes in Dispersive Fading Channels
A new scheme of concatenating the block turbo code (BTC) with the space-time block code (STBC) for an OFDM system in dispersive fading channels is investigated in this paper.
Kam Tai Chan, Yinggang Du
doaj +1 more source
The work in this paper is an extension of the recently proposed stacked Alamouti based spatial modulation (SA-SM) scheme. The motivation is that by taking advantage of the existing full-diversity full-rate (FDFR) space-time code, to construct SM ...
Lei Wang
doaj +1 more source
Structured Random Linear Codes (SRLC): Bridging the Gap between Block and Convolutional Codes [PDF]
Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a simple yet ...
Asaeda, Hitoshi +2 more
core +3 more sources
Alamouti code based on block repetition in FBMC/OQAM systems
In this paper, we address the Alamouti code in Filter-Bank Multicarrier with Offset Quadrature Amplitude Modulation (FBMC/OQAM) and propose a novel block-wise Alamouti code, in which a repeated block is designed to eliminate the imaginary interference ...
Dejin Kong +4 more
doaj +1 more source
Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal $\F_4$-linear and $\F_2$-linear convolutional codes, respectively.
Forney, Jr., G. David, Guha, Saikat
core +2 more sources
Neural networks, error-correcting codes, and polynomials over the binary n-cube [PDF]
Several ways of relating the concept of error-correcting codes to the concept of neural networks are presented. Performing maximum-likelihood decoding in a linear block error-correcting code is shown to be equivalent to finding a global maximum of the ...
Blaum, Mario, Bruck, Jehoshua
core +1 more source
Concatenated Polar Codes [PDF]
Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems.
Bakshi, Mayank +2 more
core +3 more sources

