Semakov N V

Publications in Math-Net.Ru

1. Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects
   
   Probl. Peredachi Inf., 19:3 (1983),  29–37
2. Uniformly Packed Codes
   
   Probl. Peredachi Inf., 7:1 (1971),  38–50
3. Balanced Codes and Tactical Configurations
   
   Probl. Peredachi Inf., 5:3 (1969),  28–36
4. A Class of Maximum Equidistant Codes
   
   Probl. Peredachi Inf., 5:2 (1969),  84–87
5. Complete and Quasi-complete Balanced Codes
   
   Probl. Peredachi Inf., 5:2 (1969),  14–18
6. Equidistant $q$-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs
   
   Probl. Peredachi Inf., 4:2 (1968),  3–10