Results 31 to 40 of about 14,201 (261)
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
On isometries for convolutional codes
Advances in Mathematics of Communications, 2009 In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are certain types of monomial transformations.
openaire +2 more sources
Current Status and Challenges in Data Collection for Aerospace Coatings Deposited by Plasma Spraying
Advanced Engineering Materials, EarlyView.An innovative approach has been integrated into the GRENAT project to optimize plasma spraying and coating performance. Raw materials are accelerated and melted in the plasma generated by torches, creating coatings. Monitoring sensors collect process data which are combined with ex situ characterization data.
Lila Randriamananjara +8 more
wiley +1 more source
Research of fast decoding for longer constraint length convolutional codes
Tongxin xuebao, 2010 To overcome the disadvantage of Viterbi decoding algorithm, in which its complexity exponentially increases with the increasing constraint length of convolutional codes, and the decoding delay was too large to fit the decoding of longer constraint length
HUANG Xiao-ling, YANG Hua-long
doaj +2 more sources
CoRR, 2017 Arikan's Polar codes attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by 1/2. Since their discovery, many attempts have been made to improve the error exponent and the finite block-
Andrew James Ferris +2 more
openaire +2 more sources
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
A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy
Advanced Engineering Materials, EarlyView.A lightweight and reproducible denoising pipeline for high‐throughput Raman spectroscopy is introduced, based on a 1D convolutional autoencoder trained with a Noise2Noise strategy. Using only repeated short‐exposure acquisitions, the method suppresses stochastic noise without reference spectra, enabling reliable spectral reconstruction while preserving
David Martin‐Calle +5 more
wiley +1 more source
Rate-compatible LDPC convolutional codes over non-gaussian noise channel [PDF]
MATEC Web of Conferences, 2020 This paper is aimed to study the characteristics of the underwater acoustic channel with non-Gaussian noise channel. And Gaussian mixture model (GMM) is utilized to fit the background noise over the non-Gaussian noise channel.
Liu Qiang
doaj +1 more source
Information and Control, 1963 Summary: This paper describes a class of infinite convolution codes which are designed to minimize the time required to recover from an erasure burst on the binary erasure channel. It is shown that for any given rate, there exists a unique optimum erasure burst correcting code.
openaire +1 more source
Description of a Quantum Convolutional Code [PDF]
Physical Review Letters, 2003 4 pages, uses revtex4.
Ollivier, H., Tillich, Jean-Pierre
openaire +4 more sources