Valery Zolotarev

Learn More
– Symbolic q-ary multithreshold decoding (qMTD) of q-ary self-orthogonal codes is submitted. It's shown the BER performance of qMTD is close to the results provided by optimum total search methods, which are not realizable for non-binary codes in general. New decoders are compared with different decoders of Reed-Solomon codes. The performance provided by(More)
Information transmission through communicational channels becomes considerably more difficult because of the disturbances and noises in the channel. An effective mean for increasing of truthworseness of transmitted information is a noiseproof coding. There is a comparison of basic algorithms of noiseproof codes decoding, based on the materials of(More)
The iterative majority improved decoders are described. They are called multithreshold decoders (MTD). These decoders have a property of convergence to the solution of the optimum decoder with keeping linear complexity of implementation, which one is a property of usual threshold procedures. Different decoding applications are discussed. Experimental(More)
The principles of operation and performance of multithreshold decoders (MTD) are reviewed in the field of high levels of a channel noise. These methods in many cases are so effective, as optimum decoding procedures with total search. The complexity of their implementation is practically linear on code length. The generalizations of MTD for non-binary(More)
They well know, that error correcting codes allow to provide the transmission with a given reliability in satellite and other communication channels at much lower level of a signal in comparison with variant of transmission without coding [1, 2]. For those channels, in which the signal energy is limited, codes create effect of power increasing for the(More)
In NIIRadio and in Space Research Institute RAS (Moscow, Russia) the development of effective multithreshold decoding (MTD) algorithms is finished successfully for noiseproof coding. The code gain (CG) in energy is 7 dB and even more. For the first time this CG is reached at minimally possible complexity of decoder implementation and with practically(More)