Leonid A. Bassalygo - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2022

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson BoundLeonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev. poit, 58(1):1-12, 2022. [doi]

2020

Retraction Note: Note on "Smaller Explicit Superconcentrators" by N. Alon and M. CapalboLeonid A. Bassalygo. poit, 56(4):399, 2020. [doi]

Symmetric Block Designs and Optimal Equidistant CodesLeonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev. poit, 56(3):245-252, 2020. [doi]

2019

Note on "Smaller Explicit Superconcentrators" by N. Alon and M. CapalboLeonid A. Bassalygo. poit, 55(3):295-297, 2019. [doi]

2018

q-ary Constant-Weight CodesLeonid A. Bassalygo, Victor A. Zinoviev, V. S. Lebedev. poit, 54(3):245-252, 2018. [doi]

2017

On Kloosterman sums over finite fields of characteristic 3Leonid A. Bassalygo, Victor Zinoviev. DAM, 216:518-523, 2017. [doi]

q-ary constant-weight codesLeonid A. Bassalygo, Victor A. Zinoviev. poit, 53(1):51-54, 2017. [doi]

q-ary constant-weight codes"Leonid A. Bassalygo, Victor A. Zinoviev. poit, 53(3):305, 2017. [doi]

2015

Permutation and complete permutation polynomialsLeonid A. Bassalygo, Victor A. Zinoviev. ffa, 33:198-211, 2015. [doi]

2014

Optimal almost equisymbol codes based on difference matricesLeonid A. Bassalygo, Victor A. Zinoviev. poit, 50(4):313-319, 2014. [doi]

2013

Multiple-access hyperchannelLeonid A. Bassalygo, Vyacheslav V. Rykov. poit, 49(4):299-307, 2013. [doi]

On the number of nonzero permanents over a finite field of odd characteristicLeonid A. Bassalygo. poit, 49(4):382-383, 2013. [doi]

On divisibility of exponential sums of polynomials of special type over fields of characteristic 2Leonid A. Bassalygo, Victor A. Zinoviev. dcc, 66(1-3):129-143, 2013. [doi]

2009

A model of restricted asynchronous multiple access in the presence of errorsLeonid A. Bassalygo. poit, 45(1):37-45, 2009. [doi]

2006

The Grey-Rankin bound for nonbinary codesLeonid A. Bassalygo, Stefan M. Dodunekov, Victor A. Zinoviev, Tor Helleseth. poit, 42(3):197-203, 2006. [doi]

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this boundLeonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. itw 2006: 278-282 [doi]

2005

Nonbinary Error-Correcting Codes with One-Time Error-Free FeedbackLeonid A. Bassalygo. poit, 41(2):125-129, 2005. [doi]

2001

Correction of Ordinary and Localized ErrorsLeonid A. Bassalygo, Mark S. Pinsker. poit, 37(4):325-328, 2001. [doi]

2000

Codes with forbidden distancesLeonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor. DM, 213(1-3):3-11, 2000. [doi]

1997

On codes correcting weakly localized errorsLeonid A. Bassalygo, Mark S. Pinsker. TIT, 43(1):363-364, 1997.

1995

Localized random and arbitrary errors in the light of arbitrarily varying channel theoryRudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker. TIT, 41(1):14-25, 1995.

Supports of a CodeLeonid A. Bassalygo. AAECC 1995: 1-3

1993

Nonbinary codes correcting localized errorsRudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker. TIT, 39(4):1413, 1993.

1991

Coding for partially localized errorsLeonid A. Bassalygo, S. I. Gelfand, Mark S. Pinsker. TIT, 37(3):880, 1991.

1988

Kolmogorov rememberedLeonid A. Bassalygo, Roland L. Dobrushin, Mark S. Pinsker. TIT, 34(2):174-175, 1988.

Sign in or sign up to see more results.

runs on WebDSL