The following pages link to Simon N. Litsyn (Q1199594):
Displayed 43 items.
- A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code (Q4544595) (← links)
- (Q4658950) (← links)
- Improved upper bounds on sizes of codes (Q4674469) (← links)
- On ensembles of low-density parity-check codes: asymptotic distance distributions (Q4674470) (← links)
- Upper bounds on the rate of LDPC codes (Q4677565) (← links)
- Several new lower bounds on the size of codes with covering radius one (Q4701178) (← links)
- On the distance distribution of duals of BCH codes (Q4701259) (← links)
- More on the distance distribution of BCH codes (Q4701260) (← links)
- New upper bounds on error exponents (Q4701290) (← links)
- Upper bounds on the size of quantum codes (Q4701371) (← links)
- New upper bounds on generalized weights (Q4701380) (← links)
- (Q4733831) (← links)
- Lower bounds for complete rational trigonometric sums (Q4733948) (← links)
- On spectra of BCH codes (Q4836906) (← links)
- Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points (Q4837648) (← links)
- Upper bounds on generalized distances (Q4850315) (← links)
- (Q4858429) (← links)
- On the accuracy of the binomial approximation to the distance distribution of codes (Q4859771) (← links)
- Football Pools--A Game for Mathematicians (Q4870014) (← links)
- Weighted coverings and packings (Q4880308) (← links)
- (Q4882552) (← links)
- On the traveling salesman problem in binary Hamming spaces (Q4885735) (← links)
- (Q4886130) (← links)
- (Q4886142) (← links)
- More on the covering radius of BCH codes (Q4887087) (← links)
- Tilings of Binary Spaces (Q4895630) (← links)
- (Q4945066) (← links)
- (Q4948746) (← links)
- (Q4954431) (← links)
- Typical peak sidelobe level of binary sequences (Q4976069) (← links)
- (Q5013058) (← links)
- On the Distribution of Boolean Function Nonlinearity (Q5189500) (← links)
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid (Q5317597) (← links)
- (Q5395416) (← links)
- (Q5441478) (← links)
- IRRATIONAL FACTORS SATISFYING THE LITTLE FERMAT THEOREM (Q5716124) (← links)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Q5898601) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900933) (← links)
- On the distance distributions of BCH codes and their duals (Q5937089) (← links)
- Binary \(B_2\)-sequences: a new upper bound (Q5937131) (← links)
- Short dominating paths and cycles in the binary hypercube (Q5939208) (← links)
- Bounds on identifying codes (Q5951931) (← links)
- The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem (Q6237965) (← links)