Nikolai L. Manev

Learn More
The sets of minimal codewords in linear codes were considered for the first time in connection with a decoding algorithm (Tai-Yang Hwang [2]). Additional interest to them was sparked by a work of J. Massey [3], where it was shown that they describe minimal access structures in secret-sharing based on linear codes. Definition. Let C be a q−ary linear code. A(More)
Codes capable to correct two errors of value ±1 in a codeword are constructed and studied. Large number of experiments simulating the implementation of several double ±1-error correctable codes in QAM-modulation schemes have been carried out. The obtained results present in graphical form the performance of the coded modulation schemes based on the(More)