منابع مشابه
Decoding Linear Codes
We mention four recent results, none of which has appeared yet. They come from different sources. The purpose of these notes is to present them in a short way. Two results concern the generalization of the Roos-bound from cyclic codes to more general linear codes. Two others concern the use of majority coset decoding to the decoding of cyclic codes. ∗Supported by NWO, The Netherlands. Prepared ...
متن کاملPermutation decoding of ℤ2ℤ4-linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As a ...
متن کاملLooping linear programming decoding of LDPC codes
Considering the Linear Programming (LP) decoding of Low-Density-Parity-Check (LDPC) code [1], we describe an efficient algorithm for finding pseudo codewords with the smallest effective distance. The algorithm, coined LP-loop, starts from choosing randomly initial configuration of the noise. The configuration is modified through a discrete number of steps. Each step consists of two sub-steps. F...
متن کاملTrellis decoding complexity of linear block codes
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...
متن کاملMultitree search decoding of linear codes
Tree search algorithms have a long history in computer science. In the coding literature, tree search algorithms have traditionally been used for decoding convolutional codes. Convolutional codes are linear codes with a special structure. Classic tree search decoders (most notably the sequential decoder) search one code tree in which the bits are ordered sequentially. We propose a multitree sea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2020
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2019.2955724