Kolmogorov remembered. - Leonid A. Bassalygo; Roland L. Dobrushin; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1988)

Coding for partially localized errors. - Leonid A. Bassalygo; S. I. Gelfand; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1991)

Nonbinary codes correcting localized errors. - Rudolf Ahlswede; Leonid A. Bassalygo; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1993)

Supports of a Code. - Leonid A. Bassalygo (AAECC, 1995)

Localized random and arbitrary errors in the light of arbitrarily varying channel theory. - Rudolf Ahlswede; Leonid A. Bassalygo; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1995)

On codes correcting weakly localized errors. - Leonid A. Bassalygo; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1997)

Codes with forbidden distances. - Leonid A. Bassalygo; Gérard D. Cohen; Gilles Zémor (Discret. Math., 2000)

Correction of Ordinary and Localized Errors. - Leonid A. Bassalygo; Mark S. Pinsker (Probl. Inf. Transm., 2001)

Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback. - Leonid A. Bassalygo (Probl. Inf. Transm., 2005)

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. - Leonid A. Bassalygo; Stefan M. Dodunekov; Tor Helleseth; Victor A. Zinoviev (ITW, 2006)

The Grey-Rankin bound for nonbinary codes. - Leonid A. Bassalygo; Stefan M. Dodunekov; Victor A. Zinoviev; Tor Helleseth (Probl. Inf. Transm., 2006)

A model of restricted asynchronous multiple access in the presence of errors. - Leonid A. Bassalygo (Probl. Inf. Transm., 2009)

On divisibility of exponential sums of polynomials of special type over fields of characteristic 2. - Leonid A. Bassalygo; Victor A. Zinoviev (Des. Codes Cryptogr., 2013)

On the number of nonzero permanents over a finite field of odd characteristic. - Leonid A. Bassalygo (Probl. Inf. Transm., 2013)

Multiple-access hyperchannel. - Leonid A. Bassalygo; Vyacheslav V. Rykov (Probl. Inf. Transm., 2013)

Optimal almost equisymbol codes based on difference matrices. - Leonid A. Bassalygo; Victor A. Zinoviev (Probl. Inf. Transm., 2014)

Permutation and complete permutation polynomials. - Leonid A. Bassalygo; Victor A. Zinoviev (Finite Fields Their Appl., 2015)

On Kloosterman sums over finite fields of characteristic 3. - Leonid A. Bassalygo; Victor A. Zinoviev (Discret. Appl. Math., 2017)

Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes. - Leonid A. Bassalygo; Victor A. Zinoviev (Probl. Inf. Transm., 2017)

Erratum to: "Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes". - Leonid A. Bassalygo; Victor A. Zinoviev (Probl. Inf. Transm., 2017)

On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes. - Leonid A. Bassalygo; Victor A. Zinoviev; Vladimir S. Lebedev (Probl. Inf. Transm., 2018)

Retraction Note: Note on "Smaller Explicit Superconcentrators" by N. Alon and M. Capalbo. - Leonid A. Bassalygo (Probl. Inf. Transm., 2020)

Symmetric Block Designs and Optimal Equidistant Codes. - Leonid A. Bassalygo; Victor A. Zinoviev; Vladimir S. Lebedev (Probl. Inf. Transm., 2020)

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound. - Leonid A. Bassalygo; Victor A. Zinoviev; Vladimir S. Lebedev (Probl. Inf. Transm., 2022)

Constructions of Nonbinary Codes Meeting the Johnson Bound. - Leonid A. Bassalygo; Victor A. Zinoviev; Vladimir S. Lebedev (Probl. Inf. Transm., 2024)