Valentine B. Afanassiev

Valentine B. Afanassiev

Auto-generated profile, based on publicly available information

Valentine B. Afanassiev

Russian Academy of Sciences

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2012 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
VAValentin Afanassiev
Valentin Afanassiev
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko

1 November 2001 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
JNJesper Ødum Nielsen
Jesper Ødum Nielsen
VAValentine Afanassiev
Valentine Afanassiev
JAJørgen Bach Andersen
Jørgen Bach Andersen

1 January 1997
Verified
Book Chapter
Closed access
PDF file
VAValentine Afanassiev
Valentine Afanassiev
CGChristian Gehrmann
Christian Gehrmann
BSBen Smeets
Ben Smeets

1 April 2002 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
VAValentine B. Afanassiev
Valentine B. Afanassiev
ADAlexander A. Davydov
Alexander A. Davydov

1 December 2016 in Journal of Communications Technology and Electronics
Verified
Journal Article
Closed access
PDF file
VAV. B. Afanassiev
V. B. Afanassiev
ADA. A. Davydov
A. A. Davydov
DZD. K. Zigangirov
D. K. Zigangirov
The problem of minimization of the decoder error probability is considered for shortened codes of dimension 2 m with distance 4 and 6. We prove that shortened Panchenko codes with distance 4 achieve the minimal probability of decoder error under special form of shortening. This shows that Hamming codes are not the best. In the paper, the rules for shortening Panchenko codes are defined and a combinatorial method to minimize the number of words of weight 4 and 5 is developed. There are obtained exact lower bounds on the probability of decoder error and the full solution of the problem of minimization of the decoder error probability for [39,32,4] and [72,64,4] codes. For shortened BCH codes with distance 6, upper and lower bounds on the number of minimal weight codewords are derived. There are constructed [45,32,6] and [79,64,6] BCH codes with the number of weight 6 codewords close to the lower bound and the decoder error probabilities are calculated for these codes. The results are intended for use in memory devices.

1 June 2014
Verified
Conference Paper
Closed access
VAValentin B. Afanassiev
Valentin B. Afanassiev
EGErnst M. Gabidulin
Ernst M. Gabidulin
NPNina I. Pilipchuk
Nina I. Pilipchuk
Network coding is a new direction of communications and information theory. Algebraic coding in this area is based on Grassmann metric known also as subspace metric. The paper is devoted to some bounds on cardinality of codes in Grassmann metric.