arXiv subjects

Alexander Zhdanov

Publications and source records attributed to Alexander Zhdanov.

3 recordsLinked to original sources

arXiv2017

Convolutional encoding of 60,64,68,72-bit self-dual codes

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one of the encoder outputs and the first row in the quasi-cyclic generator matrix is replaced by the obtained row. The pure quasi-cyclic construction with K=10 is also available for [68,34,12] and [72,36,12] codes. The new [72,36,12] singly even self-dual code with parameters Beta=483 Gamma=0 was obtained.

cs.IT↗

arXiv2017

IRA codes derived from Gruenbaum graph

In this paper, we consider coding of short data frames (192 bits) by IRA codes. A new interleaver for the IRA codes based on a Gruenbaum graph is proposed. The difference of the proposed algorithm from known methods consists in the following: permutation is performed by using a match smaller interleaver which is derived from the Gruenbaum graph by finding in this graph a Hamiltonian path, enumerating the passed vertices in ascending order and passing them again in the permuted order through the edges which are not included in the Hamiltonian path. For the IRA code the obtained interleaver provides 0.7-0.8 db gain over a convolutional code decoded by Viterbi algorithm.

cs.IT↗

arXiv2007

Isochronous Data Transmission With Rates Close to Channel Capacity

The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.

cs.IT↗