The following pages link to Alexey A. Kreshchuk (Q265611):
Displaying 12 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- (Q375963) (redirect page) (← links)
- Codes for MIMO transmission based on orthogonal sequences (Q375964) (← links)
- Statistical demodulators for frequency shift keying with fast frequency hopping (Q462095) (← links)
- (Q1705527) (redirect page) (← links)
- On the performance of block woven codes constructions with row-wise permutations (Q1705529) (← links)
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\) (Q1743271) (← links)
- Better goodness-of-fit statistics for coded FSK decoding (Q1743297) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
- (Q3382213) (← links)
- (Q5219836) (← links)
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method (Q6660011) (← links)