Available identifiers
zbMath Open baicheva.tsonka-stefanova MaRDI QID Q1381614
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv . We are working on additional sources - please check back here soon!
Publication Date of Publication Type An update on optimal \((v,4,1)\) binary cyclically permutable constant weight codes and cyclic \(2-(v,4,1)\) designs with small \(v\) 2025-01-10 Paper On the diffusion of the improved generalized Feistel 2022-01-24 Paper https://portal.mardi4nfdi.de/entity/Q5858345 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 2019-02-20 Paper Optimal conflict-avoiding codes for three, four and five active users 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\) 2013-09-30 Paper Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters 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\). 2012-03-13 Paper All binary linear codes of lengths up to 18 or redundancy up to 10 are normal 2012-01-25 Paper On the least covering radius of binary linear codes of dimension 6 2011-06-03 Paper Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions 2009-02-24 Paper https://portal.mardi4nfdi.de/entity/Q3535873 2008-11-15 Paper On the error-correcting performance of some binary and ternary linear codes 2008-07-11 Paper https://portal.mardi4nfdi.de/entity/Q5709171 2005-11-29 Paper https://portal.mardi4nfdi.de/entity/Q5709057 2005-11-28 Paper https://portal.mardi4nfdi.de/entity/Q5709059 2005-11-28 Paper On the least covering radius of binary linear codes with small lengths 2005-05-31 Paper https://portal.mardi4nfdi.de/entity/Q4664651 2005-04-08 Paper On the covering radius of ternary negacyclic codes with length up to 26 2002-08-04 Paper On the performance of the ternary [13, 7, 5] quadratic-residue code 2002-08-04 Paper https://portal.mardi4nfdi.de/entity/Q4500991 2000-09-03 Paper https://portal.mardi4nfdi.de/entity/Q4500973 2000-09-03 Paper Optimal binary one-error-correcting codes of length 10 have 72 codewords 1999-11-21 Paper Covering radii of ternary linear codes of small dimensions and codimensions 1999-11-12 Paper https://portal.mardi4nfdi.de/entity/Q3838728 1999-03-09 Paper https://portal.mardi4nfdi.de/entity/Q3838666 1998-11-22 Paper The covering radius of ternary cyclic codes with length up to 25 1998-03-18 Paper
Research outcomes over time
This page was built for person: Tsonka Stefanova Baicheva
