Results 51 to 60 of about 1,432,277 (142)
New Extremal Binary Self-Dual Codes from Block Circulant Matrices and Block Quadratic Residue Circulant Matrices [PDF]
In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct self-dual codes of various lengths over F2 and F2 + uF2. Using extensions, neighbours and sequences of neighbours,
arxiv
Sphere packing bounds in the Grassmann and Stiefel manifolds
Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block codes this leads
Henkel, Oliver
core +1 more source
Array Convolutional Low-Density Parity-Check Codes
This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC)
Baldi, Marco+2 more
core +1 more source
Minimum BER Receiver Filters with Block Memory for Uplink DS-CDMA Systems
The problem of synchronous multiuser receiver design in the case of direct-sequence single-antenna code division multiple access (DS-CDMA) uplink networks is studied over frequency selective fading channels.
Mérouane Debbah+1 more
doaj +2 more sources
Computing the minimum distance of nonbinary LDPC codes using block Korkin-Zolotarev method [PDF]
In article present measure code distance algorithm of binary and ternary linear block code using block Korkin-Zolotarev (BKZ). Proved the upper bound on scaling constant for measure code distance of non-systematic linear block code using BKZ-method for different value of the block size.
arxiv
Good Concatenated Code Ensembles for the Binary Erasure Channel
In this work, we give good concatenated code ensembles for the binary erasure channel (BEC). In particular, we consider repeat multiple-accumulate (RMA) code ensembles formed by the serial concatenation of a repetition code with multiple accumulators ...
Amat, Alexandre Graell i, Rosnes, Eirik
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
Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity
The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered.
Chen Yanni, Parhi Keshab K
doaj +1 more source
Quantum Measurements and Gates by Code Deformation
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks.
Alicki R Fannes M Horodecki M+9 more
core +1 more source
Purpose This paper examines the effect of spatial aggregation error on statistical estimates of the association between spatial access to health care and late-stage cancer.
Wang Fahui, McLafferty Sara, Luo Lan
doaj +1 more source