Simon N. Litsyn

From MaRDI portal
Person:1199594

Available identifiers

zbMath Open litsyn.simon-nWikidataQ102427841 ScholiaQ102427841MaRDI QIDQ1199594

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50130582021-11-26Paper
Typical peak sidelobe level of binary sequences2017-07-27Paper
Binary Polarization Kernels From Code Decompositions2017-04-28Paper
Recursive descriptions of polar codes2017-03-09Paper
Bounds on Distance Distributions in Codes of Given Size2015-10-27Paper
New asymptotic bounds on the size of multiple packings of the Euclidean sphere2011-11-25Paper
New upper bounds on codes via association schemes and linear programming2011-03-10Paper
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)2010-11-04Paper
Weight distribution moments of random linear/coset codes2010-09-16Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
On the Distribution of Boolean Function Nonlinearity2010-03-17Paper
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds2009-02-24Paper
Improved Upper Bounds on the Reliability Function of the Gaussian Channel2009-02-24Paper
Testing Reed–Muller Codes2008-12-21Paper
Bounds on Distance Distributions in Codes of Known Size2008-12-21Paper
Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes2008-12-21Paper
Upper bounds on the rate of LDPC codes as a function of minimum distance2008-12-21Paper
Improved upper bounds for codes with unequal error protection2008-12-21Paper
Lattices Which Are Good for (Almost) Everything2008-12-21Paper
Distance distributions in ensembles of irregular low-density parity-check codes2008-12-21Paper
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design2008-12-21Paper
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity2008-12-21Paper
Efficient Serial Message-Passing Schedules for LDPC Decoding2008-12-21Paper
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)2008-11-27Paper
https://portal.mardi4nfdi.de/entity/Q54414782008-02-15Paper
Improved lower bounds on sizes of single-error correcting codes2007-09-20Paper
https://portal.mardi4nfdi.de/entity/Q35945652007-08-08Paper
A new upper bound on the rate of non-binary codes2007-04-05Paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes2007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q53954162006-10-30Paper
https://portal.mardi4nfdi.de/entity/Q33744082006-03-09Paper
IRRATIONAL FACTORS SATISFYING THE LITTLE FERMAT THEOREM2006-01-09Paper
Exact Minimum Density of Codes Identifying Vertices in the Square Grid2005-09-16Paper
Improved upper bounds on sizes of codes2005-05-11Paper
On ensembles of low-density parity-check codes: asymptotic distance distributions2005-05-11Paper
Upper bounds on the rate of LDPC codes2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q46589502005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q44742662004-08-04Paper
A coding theory bound and zero-sum square matrices2004-03-04Paper
Generalized hashing and parent-identifying codes.2004-01-06Paper
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori2003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49487462003-08-06Paper
Intersecting codes and separating codes2003-06-10Paper
https://portal.mardi4nfdi.de/entity/Q45366482002-11-23Paper
New bounds on the distance distribution of extended Goppa codes2002-09-30Paper
Estimates of the distance distribution of codes and designs2002-08-04Paper
A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code2002-08-04Paper
Short dominating paths and cycles in the binary hypercube2002-07-14Paper
On the distance distributions of BCH codes and their duals2002-05-05Paper
Linear programming bounds for codes of small size2002-04-21Paper
https://portal.mardi4nfdi.de/entity/Q45026212002-03-18Paper
https://portal.mardi4nfdi.de/entity/Q27172062002-03-13Paper
Bounds on identifying codes2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q27610132001-12-17Paper
Binary \(B_2\)-sequences: a new upper bound2001-10-29Paper
https://portal.mardi4nfdi.de/entity/Q27413892001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q27414122001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q45107972001-10-13Paper
https://portal.mardi4nfdi.de/entity/Q27172122001-09-18Paper
https://portal.mardi4nfdi.de/entity/Q42420122001-09-18Paper
https://portal.mardi4nfdi.de/entity/Q27136612001-06-10Paper
A new upper bound on the reliability function of the Gaussian channel2001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49450662001-03-18Paper
Asymptotically exact bounds on the size of high-order spectral-null codes2000-09-07Paper
On relations between covering radius and dual distance2000-09-07Paper
On binary constructions of quantum codes2000-09-07Paper
An improved upper bound on the minimum distance of doubly-even self-dual codes2000-09-07Paper
Quantum error detection .II. Bounds2000-09-07Paper
Quantum error detection .I. Statement of the problem2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q49544312000-06-07Paper
Several new lower bounds on the size of codes with covering radius one1999-11-21Paper
On the distance distribution of duals of BCH codes1999-11-21Paper
More on the distance distribution of BCH codes1999-11-21Paper
New upper bounds on error exponents1999-11-21Paper
Upper bounds on the size of quantum codes1999-11-21Paper
New upper bounds on generalized weights1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42420151999-10-18Paper
New Bounds On Covering Radius as a Function of Dual Distance1999-06-27Paper
https://portal.mardi4nfdi.de/entity/Q43528241999-02-28Paper
On the covering radius of an unrestricted code as a function of the rate and dual distance1999-01-25Paper
A class of array codes correcting multiple column erasures1998-12-13Paper
Codes correcting phased burst erasures1998-12-13Paper
On upper bounds for minimum distance and covering radius of non-binary codes1998-11-17Paper
https://portal.mardi4nfdi.de/entity/Q42178781998-11-11Paper
Long packing and covering codes1998-11-04Paper
On covering radius and discrete Chebyshev polynomials1998-05-13Paper
Bounds on spectra of codes with known dual distance1998-03-18Paper
https://portal.mardi4nfdi.de/entity/Q43527821998-01-26Paper
Linear programming bounds for doubly-even self-dual codes1998-01-13Paper
Estimates for the range of binomiality in codes' spectra1998-01-05Paper
Tiling Hamming space with few spheres1997-12-02Paper
Covering radius 1985-19941997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43424971997-06-22Paper
On greedy algorithms in coding theory1997-04-27Paper
https://portal.mardi4nfdi.de/entity/Q48861301997-04-09Paper
https://portal.mardi4nfdi.de/entity/Q48861421997-04-09Paper
Upper bounds on the covering radius of a code with a given dual distance1997-03-25Paper
Weighted coverings and packings1997-03-25Paper
Parameters of Goppa codes revisited1997-01-01Paper
On the traveling salesman problem in binary Hamming spaces1996-12-12Paper
Tilings of Binary Spaces1996-11-20Paper
Fast decoding of non-binary first order Reed-Muller codes1996-10-10Paper
More on the covering radius of BCH codes1996-07-31Paper
On integral zeros of Krawtchouk polynomials1996-07-09Paper
https://portal.mardi4nfdi.de/entity/Q48825521996-06-18Paper
Football Pools--A Game for Mathematicians1996-05-09Paper
Two new bounds on the size of binary codes with a minimum distance of three1996-04-22Paper
Fast decoding algorithms for first order Reed-Muller and related codes1996-04-08Paper
On the accuracy of the binomial approximation to the distance distribution of codes1996-02-12Paper
https://portal.mardi4nfdi.de/entity/Q48584291996-02-06Paper
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points1996-01-24Paper
Upper bounds on generalized distances1995-10-09Paper
On spectra of BCH codes1995-06-21Paper
The uniqueness of the Best code1995-03-01Paper
Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables1994-04-24Paper
https://portal.mardi4nfdi.de/entity/Q42763231994-01-27Paper
Character sum constructions of constrained error-correcting codes1994-01-21Paper
Bounds for binary multiple covering codes1993-08-29Paper
https://portal.mardi4nfdi.de/entity/Q40387381993-05-18Paper
Error-correcting codes with bounded running digital sum1993-05-16Paper
On the covering radius of Reed-Muller codes1993-01-16Paper
DC-constrained codes from Hadamard matrices1991-01-01Paper
A note on perfect multiple coverings of the Hamming space1991-01-01Paper
Concatenated codes in Euclidean space1989-01-01Paper
Lower bound of overall exponential sums for polynomials \(\phi(x^ d)\)1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47338311989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37841601988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38123461988-01-01Paper
Lower bounds for complete rational trigonometric sums1988-01-01Paper
General code shortening construction1987-01-01Paper
Constructive high-dimensional sphere packings1987-01-01Paper
Dual distance of BCH codes1986-01-01Paper
Dual fail-safe separating systems1986-01-01Paper
A note on lower bounds (Corresp.)1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36951791985-01-01Paper
Algebro-geometrical and number-theoretical packings of balls inRN1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37242361985-01-01Paper
Shortening of codes1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32165661984-01-01Paper
Fast decoding algorithm for first-order Reed-Muller codes1983-01-01Paper
Methods of code lengthening1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Simon N. Litsyn