The following pages link to (Q5538637):
Displaying 45 items.
- Coding of image feature descriptors for distributed rate-efficient visual correspondences (Q409091) (← links)
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel (Q415651) (← links)
- Systematic design of single carrier overlap frequency domain equalization (Q469627) (← links)
- Vectorizing computations at decoding of nonbinary codes with small density of checks (Q507108) (← links)
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) (Q514531) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Generalized superposition modulation and iterative demodulation: a capacity investigation (Q542997) (← links)
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth (Q543230) (← links)
- Message-passing algorithms for inference and optimization (Q658470) (← links)
- Rational maps and maximum likelihood decodings (Q692031) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Random matrices and codes for the erasure channel (Q848850) (← links)
- Error-correcting codes and cryptography (Q937222) (← links)
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation (Q1048821) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Explicit constructions of graphs without short cycles and low density codes (Q1167742) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- LDPC codes constructed from cubic symmetric graphs (Q2081552) (← links)
- High-rate LDPC codes from partially balanced incomplete block designs (Q2114791) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition (Q2279665) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems (Q2432159) (← links)
- LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems (Q2508105) (← links)
- A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes (Q2508513) (← links)
- A coding scheme that increases the code rate (Q2514072) (← links)
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283) (← links)
- Weight distribution moments of random linear/coset codes (Q2638422) (← links)
- Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation (Q2655582) (← links)
- (Q2741418) (← links)
- (Q2843623) (← links)
- The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies (Q2857123) (← links)
- Belief propagation and loop series on planar graphs (Q2900172) (← links)
- Loop series for discrete statistical models on graphs (Q2904241) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds (Q3189929) (← links)
- Properties of sparse random matrices over finite fields (Q3301049) (← links)
- Photonic circuits for iterative decoding of a class of low-density parity-check codes (Q3387054) (← links)
- (Q4638056) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)
- Survey propagation: An algorithm for satisfiability (Q5318246) (← links)
- Nowhere to go but high: a perspective on high-dimensional expanders (Q6198648) (← links)
