Tsonka Stefanova Baicheva

Learn More
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by A(n; d). By construction it is known that A(10; 3) 72 and A(11; 3) 144. These bounds have long been conjectured to be the exact values. This is here proved by classifying various codes of smaller length and lengthening these using backtracking and isomorphism(More)
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First, we give a list of infinite families of QP codes which includes all binary, ternary, and quaternary codes known to us. We continue further(More)
All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the error control performance of the CRC codes generated by the classified polynomials is calculated. A procedure, based on the computed data, for choosing the best CRC code is(More)