RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1994 Volume 30, Issue 1, Pages 70–84 (Mi ppi221)

Coding Theory

Transmission of Constant Weight Binary Sequences with Convolutional Codes and Maximum Likelihood Decoding

V. B. Balakirskii


Abstract: We study the performance of a communication system that uses linear convolutional codes for the transmission of binary sequences of fixed Hamming weight over the binary symmetric channel. The transmission method that we consider is the straightforward encoding of messages transmitted. We suggest a maximum likelihood decoding algorithm of received sequences. It is shown that this algorithm provides a more efficient tradeoff between the decoder implementation complexity and the decoding error probability than the performance of the two-stage encoding.

UDC: 621.391.156

Received: 11.11.1992


 English version:
Problems of Information Transmission, 1994, 30:1, 60–71

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024