The following pages link to (Q3293678):
Displaying 50 items.
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Minimum distances of three families of low-density parity-check codes based on finite geometries (Q282404) (← links)
- Novel multiparty controlled bidirectional quantum secure direct communication based on continuous-variable states (Q293892) (← links)
- Information storage capacity of discrete spin systems (Q336176) (← links)
- Analysis on crossover probability estimation using LDPC syndrome (Q350957) (← links)
- A class of quantum low-density parity check codes by combining seed graphs (Q352913) (← links)
- Large weight code words in projective space codes (Q426076) (← links)
- Investigation of commuting Hamiltonian in quantum Markov network (Q490391) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Efficient three-party quantum dialogue protocol based on the continuous variable GHZ states (Q518013) (← links)
- Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\) (Q650828) (← links)
- An improved multidimensional reconciliation algorithm for continuous-variable quantum key distribution (Q669854) (← links)
- Finding most likely solutions (Q733750) (← links)
- High-throughput architectures for circular block-type low-density parity-check codes (Q736977) (← links)
- Correlations between the ranks of submatrices and weights of random codes (Q841241) (← links)
- Tutorial series on brain-inspired computing. V: Statistical mechanics of communication and computation (Q867517) (← links)
- Two-layer contractive encodings for learning stable nonlinear features (Q890731) (← links)
- 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)
- Regular LDPC codes from semipartial geometries (Q925272) (← links)
- Quantum graphical models and belief propagation (Q935111) (← links)
- Understanding the scalability of Bayesian network inference using clique tree growth curves (Q991030) (← links)
- On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes (Q1003680) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Promising performance of PA-coded SIMO FM-DCSK communication systems (Q1024653) (← links)
- The dimensions of \(LU(3,q)\) codes (Q1024994) (← links)
- Pruning processes and a new characterization of convex geometries (Q1025925) (← links)
- LDPC codes from Singer cycles (Q1026131) (← links)
- Reliable computation with cellular automata (Q1090457) (← links)
- Fast correlation attacks on certain stream ciphers (Q1121241) (← links)
- Parallel versus sequential updating for belief propagation decoding (Q1412924) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- A family of low density matrices in Lagrangian-Grassmannian (Q1642915) (← links)
- Regularized Gaussian belief propagation (Q1703865) (← links)
- On analyzing LDPC codes over multiantenna MC-CDMA system (Q1718872) (← links)
- Analysis of error-correcting codes for lattice-based key exchange (Q1726688) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs (Q1741585) (← links)
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices (Q1752308) (← links)
- Channel decomposition for multilevel codes over multilevel and partial erasure channels (Q1783713) (← links)
- Skew constacyclic codes over finite fields and finite chain rings (Q1793100) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Monotonic optimization based decoding for linear codes (Q1941018) (← links)
- Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample (Q1943114) (← links)
- Moments of the support weight distribution of linear codes (Q1943987) (← links)
- Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution (Q1992109) (← links)
- Hierarchical erasure correction of linear codes (Q1994962) (← links)
- Convergence and correctness of belief propagation for the Chinese postman problem (Q2010094) (← links)
