( en | de | ru )

 

Disambiguation of "Litsyn, Simon"

Author of the publication

copydeleteadd this publication to your clipboard
DC-constrained error-correcting codes with small running digital sum.

, and . IEEE Trans. Inf. Theory, 37 (3): 949-955 (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marcus Simon

Erstellung und Validierung eines Fragebogens für die Patientenbeurteilung der perioperativen Phase, PPP-Fragebogen. Uni Marburg, (2009)

Christine Simon

Vollblutaggregation beim Hund: Vergleich der Methode nach Born mit einer errechneten Aggregation nach Thrombozytenzählung mittels konventioneller Hämatologiesysteme. Uni Gießen, (2009)

Simon Schilling

Beitrag zur dynamischen Fehlerbaumanalyse ohne Modulbildung und zustandsbasierte Erweiterungen. Uni Wuppertal, (2009)

Simon Hohenester

Zur Bedeutung von Proteinkinasen und Phosphatidylinositol-Kinasen für (anti)-cholestatische und (anti)-apoptotische Effekte von Gallensäuren in der Leberzelle. Uni München, (2009)

Simon Pingel

Retrospektive Analyse potentieller Beeinflussungsmodelle auf die Reoperationsrate nach mechanischem und biologischem Herzklappenersatz. Uni München, (2009)
 

Other publications of authors with the same name

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere., and . Discret. Comput. Geom., 46 (4): 626-635 (2011)Several New Lower Bounds on the Size of Codes with Covering Radius One., and . IEEE Trans. Inf. Theory, 44 (5): 1998-2002 (1998)Parameters of Goppa codes revisited., and . IEEE Trans. Inf. Theory, 43 (6): 1811-1819 (1997)The uniqueness of the Best code., and . IEEE Trans. Inf. Theory, 40 (5): 1693-1698 (1994)Testing Reed-Muller codes., , , , and . IEEE Trans. Inf. Theory, 51 (11): 4032-4039 (2005)On tHe Size of Identifying Codes., , and . AAECC, volume 1719 of Lecture Notes in Computer Science, page 142-147. Springer, (1999)On Covering Radius and Discrete Chebyshev Polynomials., , and . Appl. Algebra Eng. Commun. Comput., 8 (5): 395-401 (1997)On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes., and . Des. Codes Cryptogr., 14 (1): 71-80 (1998)On PMEPR of algebraic codes., , and . Eur. Trans. Telecommun., 19 (7): 773-779 (2008)Fast Algorithms for Decoding Orthogonal and Related Codes.. AAECC, volume 539 of Lecture Notes in Computer Science, page 39-47. Springer, (1991)