Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Litsyn, Simon - Department of Electrical Engineering-Systems, Tel Aviv University
On Spectra of BCH Codes Ilia Krasikov
Covering and packing the euclidean space by spheres are old and wellknown problems. The discrete counterpart of the packing problem has been ex
On accuracy of binomial approximation to the distance
, , 1--11 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
A class of array codes correcting multiple column erasures
Linear programming bounds for codes of small size
More on the distance distribution of Osnat Keren and Simon Litsyn
Asymptotically exact bounds on the size of highorder spectralnull codes
More on the covering radius of BCH codes Francoise LevyditVehel 1 and Simon Litsyn 2
The smallest covering code of length 8 and radius 2 has 12
Estimates for the Range of Binomiality in Codes' Spectra
Codes correcting phased burst erasures Osnat Keren and Simon Litsyn
Several new lower bounds for football pool systems
, , 1--13 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
On greedy algorithms in coding theory G'erard Cohen 1 , Simon Litsyn 2 and Gilles Z'emor 3
New upper bounds on error Simon Litsyn
On distribution of exponential sums in fields of characteristic two
Generalizations of the Covering Radius Problem in Coding Theory
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
On the Traveling Salesman Problem in Binary Hamming Spaces
Linear programming bounds for doublyeven selfdual codes
Parameters of Goppa codes revisited Francoise LevyditVehel 1 and Simon Litsyn 2
An improved upper bound on the minimum distance of
On Integral Zeros of Krawtchouk Polynomials
On the covering radius of long Goppa codes Francoise LevyditVehel 1 and Simon Litsyn 2