Victor Vasil'Evich Zyablov

Victor Vasil'Evich Zyablov

Auto-generated profile, based on publicly available information

Victor Vasil'Evich Zyablov

Russian Academy of Sciences

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
1 January 1994 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko
VZV. Zyablov
V. Zyablov
Soft-decision maximum-likelihood decoding of convolutional codes using the Viterbi algorithm with a syndrome trellis is proposed. The parity check matrix of a convolutional code is used to construct the trellis. This trellis is minimal. The number of operations for the decoding of one block of a q-ary rate k/n convolutional code is ~nqmin(k,n-k)qν, where ν is the memory size of the code. When the code rate satisfies k/n>½, the proposed algorithm is simpler than the classical Viterbi algorithm that has complexity ~nqkqν

1 March 1999 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SHS. Host
S. Host
RJR. Johannesson
R. Johannesson
KZK.SH. Zigangirov
K.SH. Zigangirov
VZV.V. Zyablov
V.V. Zyablov
A family of active distance measures for general convolutional codes is defined. These distances are generalizations of the extended distances introduced by Thommesen and Justesen (1983) for unit memory convolutional codes. It is shown that the error correcting capability of a convolutional code is determined by the active distances. The ensemble of periodically time-varying convolutional codes is defined and lower bounds on the active distances are derived for this ensemble. The active distances are very useful in the analysis of concatenated convolutional encoder

1 June 2011 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko
MBM. Bossert
M. Bossert
VZV. V. Zyablov
V. V. Zyablov
(Partial) unit memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a...

1 January 1998 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MBM. Breitbach
M. Breitbach
MBM. Bossert
M. Bossert
VZV. Zyablov
V. Zyablov
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko
A novel construction method is presented for array codes correcting a single rectangular error cluster of size b1×b2 or less. Encoding is done in such a way that parity check symbols are calculated row-or columnwise which are a word of a one-dimensional code correcting a phased burst. These parity check symbols are not transmitted but can be calculated by the receiver. Corresponding decoding algorithms are given. A code is constructed with maximum size n1=b12b2, n2=b 22b1, and r=3b1b2 redundancy symbols which is close to the generalized Singleton bound r⩾2b1 b2. Its encoding and decoding complexity are low

1 November 1999 in European Transactions on Telecommunications
Verified
Journal Article
Closed access
PDF file
VZVictor Zyablov
Victor Zyablov
SSSergo Shavgulidze
Sergo Shavgulidze
MBMartin Bossert
Martin Bossert

1 March 2000 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JMJ. Maucher
J. Maucher
VZV.V. Zyablov
V.V. Zyablov
MBM. Bossert
M. Bossert