The following pages link to Simon N. Litsyn (Q1199594):
Displaying 50 items.
- (Q188613) (redirect page) (← links)
- (Q786749) (redirect page) (← links)
- (Q1360990) (redirect page) (← links)
- Recursive descriptions of polar codes (Q514520) (← links)
- New upper bounds on codes via association schemes and linear programming (Q629753) (← links)
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere (Q650105) (← links)
- Covering radius 1985-1994 (Q676007) (← links)
- New bounds on the distance distribution of extended Goppa codes (Q700157) (← links)
- Methods of code lengthening (Q786750) (← links)
- Fast decoding algorithm for first-order Reed-Muller codes (Q794623) (← links)
- Shortening of codes (Q798612) (← links)
- A new upper bound on the rate of non-binary codes (Q874418) (← links)
- Concatenated codes in Euclidean space (Q911559) (← links)
- Dual distance of BCH codes (Q1090660) (← links)
- General code shortening construction (Q1097865) (← links)
- Constructive high-dimensional sphere packings (Q1099210) (← links)
- Dual fail-safe separating systems (Q1103588) (← links)
- Lower bound of overall exponential sums for polynomials \(\phi(x^ d)\) (Q1113951) (← links)
- On the covering radius of Reed-Muller codes (Q1199595) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- Character sum constructions of constrained error-correcting codes (Q1311610) (← links)
- Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables (Q1320443) (← links)
- On covering radius and discrete Chebyshev polynomials (Q1360991) (← links)
- Linear programming bounds for codes of small size (Q1367593) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- On upper bounds for minimum distance and covering radius of non-binary codes (Q1379663) (← links)
- Bounds on spectra of codes with known dual distance (Q1381623) (← links)
- On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- A coding theory bound and zero-sum square matrices (Q1423490) (← links)
- Intersecting codes and separating codes (Q1811095) (← links)
- Two new bounds on the size of binary codes with a minimum distance of three (Q1904422) (← links)
- Fast decoding algorithms for first order Reed-Muller and related codes (Q1910431) (← links)
- Upper bounds on the covering radius of a code with a given dual distance (Q1911845) (← links)
- On integral zeros of Krawtchouk polynomials (Q1913998) (← links)
- Fast decoding of non-binary first order Reed-Muller codes (Q1919701) (← links)
- Improved lower bounds on sizes of single-error correcting codes (Q2383982) (← links)
- Weight distribution moments of random linear/coset codes (Q2638422) (← links)
- A new upper bound on the reliability function of the Gaussian channel (Q2705925) (← links)
- (Q2713661) (← links)
- (Q2717206) (← links)
- (Q2717212) (← links)
- (Q2741389) (← links)
- (Q2741412) (← links)
- (Q2761013) (← links)
- Binary Polarization Kernels From Code Decompositions (Q2978599) (← links)
- Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) (Q3053157) (← links)
- On greedy algorithms in coding theory (Q3129491) (← links)
- (Q3216566) (← links)
- DC-constrained codes from Hadamard matrices (Q3356227) (← links)
- A note on perfect multiple coverings of the Hamming space (Q3358651) (← links)
