|
|
Publications in Math-Net.Ru
-
Private information retrieval protocol
Mat. Vopr. Kriptogr., 6:4 (2015), 5–21
-
On the Performance of Permutation Codes for Multi-User Communication
Probl. Peredachi Inf., 39:3 (2003), 11–27
-
Joint Source-Channel Coding Using Variable-Length Codes
Probl. Peredachi Inf., 37:1 (2001), 12–27
-
Identification under Random Processes
Probl. Peredachi Inf., 32:1 (1996), 144–160
-
Transmission of Constant Weight Binary Sequences with Convolutional Codes and Maximum Likelihood Decoding
Probl. Peredachi Inf., 30:1 (1994), 70–84
-
Sequential Decoding Algorithm Producing the Maximum-Likelihood Estimate for Low-Density Gallager Codes
Probl. Peredachi Inf., 27:1 (1991), 50–60
-
Asymptotic Lower Bound on the Free Distance of Constant Linear Convolutional Codes with Rate $1/n_0$
Probl. Peredachi Inf., 26:3 (1990), 3–11
-
List Decoding of Convolutional Codes
Probl. Peredachi Inf., 25:1 (1989), 16–23
-
On Sequential Decoding of Linear Convolutional Codes
Probl. Peredachi Inf., 23:4 (1987), 41–48
-
Sequential Decoding Algorithm in a Multiple-Access Channel
Probl. Peredachi Inf., 21:3 (1985), 3–13
© , 2024