Results 21 to 30 of about 45,029 (227)
Low-Density Spreading Codes for NOMA Systems and a Gaussian Separability-Based Design
IEEE Access, 2021 Improved low-density spreading (LDS) code designs based on the Gaussian separability criterion are conceived. We show that the bit error rate (BER) hinges not only on the minimum distance criterion, but also on the average Gaussian separability margin ...
Michel Kulhandjian +3 more
doaj +1 more source
Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
, 2008 We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme.
Ching-Yu Huang +4 more
core +1 more source
Study of equivalent point-to-point transmission model for coded relay cooperations
Tongxin xuebao, 2012 LDPC-coded relay cooperation and its joint iterative decoding based on the bi-layer Tanner graph were investigated.The coded relay cooperation becomed an equivalent and relatively simple point-to-point transmission model by introducing the notation of ...
Qiu-xia ZHANG +3 more
doaj +2 more sources
On the Construction of Sparse Matrices From Expander Graphs
Frontiers in Applied Mathematics and Statistics, 2018 We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in Bah and Tanner [1]. With better bounds we derived a new reduced sample complexity for d, the number of non-zeros per column of these ...
Bubacarr Bah, Bubacarr Bah, Jared Tanner
doaj +1 more source
Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles
, 2013 In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in ...
Flanagan, Mark F. +2 more
core +1 more source
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami +1 more
doaj
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj +2 more sources
, 2011 Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph ...
Smarandache, Roxana, Vontobel, Pascal O.
core +1 more source
Interconnected Porous Hydrogels with Tunable Anisotropy Through Aqueous Emulsion Bioprinting
Advanced Functional Materials, EarlyView.A 3D bioprintable microporous bioink is developed using an aqueous two‐phase system (ATPS) composed of extracellular matrix (ECM) mimetic biopolymers. The ATPS bioink enables the fabrication of interconnected porous architectures with up to 70% porosity, supporting long‐term cell viability and 3D cell alignment, enabling a simultaneous generation of ...
Hugo Edgar‐Vilar +4 more
wiley +1 more source
Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code
Tongxin xuebao, 2008 Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code ...
ZHANG Guo-hua, WANG Xin-mei
doaj +2 more sources