Pages that link to "Item:Q3547695"
From MaRDI portal
The following pages link to LDPC Block and Convolutional Codes Based on Circulant Matrices (Q3547695):
Displaying 21 items.
- Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation (Q893648) (← links)
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices (Q893659) (← links)
- Constructions of QC LDPC codes based on integer sequences (Q893757) (← links)
- On analyzing LDPC codes over multiantenna MC-CDMA system (Q1718872) (← links)
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs (Q1741585) (← links)
- Reachability of eigenspaces for interval circulant matrices in max-algebra (Q1747281) (← links)
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices (Q1752308) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- AE and EA robustness of interval circulant matrices in max-product algebra (Q2035372) (← links)
- Construction of LDPC convolutional codes via difference triangle sets (Q2232118) (← links)
- Some low-density parity-check codes derived from finite geometries (Q2267793) (← links)
- Graph-based convolutional and block LDPC codes (Q2269366) (← links)
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles (Q2383983) (← links)
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283) (← links)
- An explicit method to generate some QC LDPC codes with girth 8 (Q2629828) (← links)
- Construction of time-invariant LDPC convolutional codes with modified method (Q2823413) (← links)
- (Q3402672) (← links)
- Laminated turbo codes: A new class of block-convolutional codes (Q3604452) (← links)
- Small weight codewords in the LDPC codes arising from linear representations of geometries (Q3614748) (← links)
- An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC (Q5197653) (← links)
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
