| Publication | Date of Publication | Type |
|---|
| Construction of \((v,k,1)\) cyclic difference families with small parameters | 2026-03-23 | Paper |
An update on optimal \((v,4,1)\) binary cyclically permutable constant weight codes and cyclic \(2-(v,4,1)\) designs with small \(v\) Problems of Information Transmission | 2025-01-10 | Paper |
On the diffusion of the improved generalized Feistel Advances in Mathematics of Communications | 2022-01-24 | Paper |
| scientific article; zbMATH DE number 7332482 (Why is no real title available?) | 2021-04-13 | Paper |
| On the diffusion property of the improved generalized Feistel with different permutations for each round | 2020-04-29 | Paper |
| About the inverse football pool problem for 9 games | 2020-03-12 | Paper |
Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths Designs, Codes and Cryptography | 2019-02-20 | Paper |
Optimal conflict-avoiding codes for three, four and five active users Problems of Information Transmission | 2018-05-24 | Paper |
| Classification of maximal optical orthogonal codes of weight 3 and small lengths | 2018-05-15 | Paper |
| Classification of optimal conflict-avoiding codes of weights 6 and 7 | 2018-04-13 | Paper |
| Minimal coverings of \({\{0, 1, 2\}}^n\) with spheres of radius \(n\) | 2017-09-04 | Paper |
Optimal (v,5,2,1) optical orthogonal codes of small v Applicable Algebra in Engineering, Communication and Computing | 2013-09-30 | Paper |
Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters Journal of Combinatorial Designs | 2012-10-29 | Paper |
Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). Problems of Information Transmission | 2012-03-13 | Paper |
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal Advances in Mathematics of Communications | 2012-01-25 | Paper |
On the least covering radius of binary linear codes of dimension 6 Advances in Mathematics of Communications | 2011-06-03 | Paper |
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions IEEE Transactions on Information Theory | 2009-02-24 | Paper |
| scientific article; zbMATH DE number 5366474 (Why is no real title available?) | 2008-11-15 | Paper |
| On the error-correcting performance of some binary and ternary linear codes | 2008-07-11 | Paper |
| scientific article; zbMATH DE number 2233514 (Why is no real title available?) | 2005-11-29 | Paper |
| scientific article; zbMATH DE number 2233285 (Why is no real title available?) | 2005-11-28 | Paper |
| scientific article; zbMATH DE number 2233286 (Why is no real title available?) | 2005-11-28 | Paper |
On the least covering radius of binary linear codes with small lengths IEEE Transactions on Information Theory | 2005-05-31 | Paper |
| scientific article; zbMATH DE number 2154102 (Why is no real title available?) | 2005-04-08 | Paper |
On the covering radius of ternary negacyclic codes with length up to 26 IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On the performance of the ternary [13, 7, 5] quadratic-residue code IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1498800 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1498783 (Why is no real title available?) | 2000-09-03 | Paper |
Optimal binary one-error-correcting codes of length 10 have 72 codewords IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Covering radii of ternary linear codes of small dimensions and codimensions IEEE Transactions on Information Theory | 1999-11-12 | Paper |
| scientific article; zbMATH DE number 1189030 (Why is no real title available?) | 1999-03-09 | Paper |
| scientific article; zbMATH DE number 1188977 (Why is no real title available?) | 1998-11-22 | Paper |
The covering radius of ternary cyclic codes with length up to 25 Designs, Codes and Cryptography | 1998-03-18 | Paper |