The following pages link to Mohammad-Reza Sadeghi (Q391136):
Displaying 22 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- The complexity of the zero-sum 3-flows (Q477676) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- On cycle-free lattices with high rate label codes (Q540391) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- Cycle structure of permutation functions over finite fields and their applications (Q1760069) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field (Q2194500) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- On the algorithmic complexity of zero-sum edge-coloring (Q2630333) (← links)
- Codes with girth 8 Tanner graph representation (Q2638415) (← links)
- Efficient Search of Girth-Optimal QC-LDPC Codes (Q2976880) (← links)
- On the performance of 1-level LDPC lattices (Q3001403) (← links)
- (Q3062109) (← links)
- (Q3374404) (← links)
- Low-Density Parity-Check Lattices: Construction and Decoding Analysis (Q3548107) (← links)
- Sigma Partitioning: Complexity and Random Graphs (Q4611774) (← links)
- (Q5124707) (← links)
- Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels (Q5151698) (← links)
- Linear label code of a root lattice using Gröbner bases (Q6139276) (← links)
- Construction of LDGM lattices (Q6233286) (← links)
- On the algorithmic complexity of decomposing graphs into regular/irregular structures (Q6296967) (← links)