Author of the publication

Binary Codes Capable of Correcting Deletions and Insertions and Reversals

. Soviet Physics Doklady, 10 (8): 707-710 (1966)

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.

 

Other publications of authors with the same name

Binary Codes Capable of Correcting Deletions and Insertions and Reversals. Soviet Physics Doklady, 10 (8): 707-710 (1966)Reconstruction of a graph from 2-vicinities of its vertices., , , and . Discret. Appl. Math., 156 (9): 1399-1406 (2008)New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes.. IEEE Trans. Inf. Theory, 45 (1): 284-288 (1999)Optimal conflict-avoiding codes for three active users., and . ISIT, page 535-537. IEEE, (2005)A conjecture on the reconstruction of graphs from metric balls of their vertices.. Discret. Math., 308 (5-6): 993-998 (2008)A system of polynomials for the complex hamming spaces.. ISIT, page 361. IEEE, (2004)The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction., , and . IEEE Trans. Inf. Theory, 50 (11): 2818-2823 (2004)Packing and Decomposition Problems for Polynomial Association Schemes.. Eur. J. Comb., 14 (5): 461-477 (1993)A universal bound for a covering in regular posets and its application to pool testing.. Discret. Math., 266 (1-3): 293-309 (2003)06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery., , and . Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, volume 06201 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)