Analysis and Error Performances of Convolutional Doubly Orthogonal Codes with Non-Binary Alphabets
Texte intégral
Documents relatifs
Keywords and phrases: Convolutional codes, linear recurrent codes, block codes, transducers, encoders, feedback decoding, linear systems, controllability, observability,
As will become clear in Section V-A, an efficient recursive evaluation of the distance properties of trellis-based AC is possible if transitions have exactly one output bit..
The code optimization using the search tree relies on bounds on the free distance of partially defined codebooks.. Definition 3: An EC-VLC is an incomplete codebook (IC) if
The more important know-how of CCSG is about algorithms for for- ward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata
Given the kernel K as a linear code of length n and the corresponding sequence of t coset representatives Rep of a binary code C, return the super dual of C, that is, the binary
Capacity-Approaching Non-Binary Turbo Codes: A Hybrid Design Based on EXIT Charts and Union
We propose a quantum error correcting code which takes advantage of this asymmetry and shows good performance at a relatively small cost in redundancy, requiring less than a doubling
On the other hand, Helleseth, Klove and Levenshtein in the paper Error correction capability of binary linear codes [7] study order 1 or 2 Reed-Muller codes and they show that