|
|
Publications in Math-Net.Ru
-
On the smallest size of an almost complete subset of a conic in $\mathrm{PG}(2,q)$ and extendability of Reed–Solomon codes
Probl. Peredachi Inf., 54:2 (2018), 3–19
-
Upper bounds on the smallest size of a complete arc in $PG(2,q)$ under a certain probabilistic conjecture
Probl. Peredachi Inf., 50:4 (2014), 22–42
-
Codes for MIMO transmission based on orthogonal sequences
Probl. Peredachi Inf., 47:4 (2011), 3–26
-
Special sequences as subcodes of Reed–Solomon codes
Probl. Peredachi Inf., 46:4 (2010), 56–82
-
Construction of Linear Covering Codes
Probl. Peredachi Inf., 26:4 (1990), 38–55
-
Correction of error bytes of length 4 and double independent errors by the Bose — Chaudhuri — Hocquenjhem code in semi-conducting memory units
Avtomat. i Telemekh., 1989, no. 11, 135–146
-
Quasiperfect Linear Binary Codes with Distance 4 and Complete Caps in Projective Geometry
Probl. Peredachi Inf., 25:4 (1989), 11–23
-
On the Number of Minimum-Weight Words in Block Codes
Probl. Peredachi Inf., 24:1 (1988), 11–24
-
Error correction in main memory of a fast computer
Avtomat. i Telemekh., 1987, no. 7, 152–165
-
A Burst-Error-Correcting Code and Its Application for Information Exchange between Computers
Probl. Peredachi Inf., 8:3 (1972), 27–37
© , 2024