Results 31 to 40 of about 19,459 (310)
Extrinsic Information Transfer Analysis and Design of Block-Based Intermediate Codes [PDF]
, 2011 Intermediate codes have been shown to facilitate iterative decoding convergence to the maximum likelihood error ratio performance in serially concatenated schemes.
Robert G. Maunder +3 more
core +1 more source
EXIT Chart Aided Design of Periodically Punctured Turbo Codes [PDF]
, 2010 EXtrinsic Information Transfer (EXIT) charts have proved to be an effective tool for studying the convergence behaviour of iterative decoders. However, classical EXIT chart analysis fails to assess the performance of turbo codes in which the systematic ...
BABICH, FULVIO +8 more
core +1 more source
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes [PDF]
, 2011 In this paper, we propose an algorithm for designing the interleavers of Serially Concatenated Codes (SCCs), in order to increase the Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence and hence to improve the ...
R. G. Maunder +3 more
core +1 more source
Divergence coding for convolutional codes
MATEC Web of Conferences, 2017 In the paper we propose a new coding/decoding on the divergence principle. A new divergent multithreshold decoder (MTD) for convolutional self-orthogonal codes contains two threshold elements.
Valery Zolotarev +4 more
doaj +1 more source
Advances in Mathematics of Communications, 2008 In this note we introduce the concept of group convolutional code. We make a complete classification of the minimal $S_3$-convolutional codes over the field of five elements by means of Jategaonkar's theorems.
Sergio Estrada +3 more
openaire +2 more sources
Short Low-Rate Non-Binary Turbo Codes
, 2012 A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields.
Paolini, Enrico +9 more
core +1 more source
On the MacWilliams Identity for Convolutional Codes [PDF]
IEEE Transactions on Information Theory, 2008 The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines the adjacency matrix of the dual code, will be formulated, and an explicit formula for the transformation will be ...
Gluesing-Luerssen, Heide +1 more
openaire +3 more sources
Description of a Quantum Convolutional Code [PDF]
Physical Review Letters, 2003 4 pages, uses revtex4.
Ollivier, H., Tillich, Jean-Pierre
openaire +4 more sources
Multimodal Data‐Driven Microstructure Characterization
Advanced Engineering Materials, EarlyView.A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Adaptive decoding of convolutional codes [PDF]
Advances in Radio Science, 2007 Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e.
K. Hueske, J. Geldmacher, J. Götze
doaj