Results 31 to 40 of about 47,586 (164)
A Fast Method for Blind Identification of Punctured Convolutional Codes [PDF]
Radioengineering, 2018 The existing method for blind identification of a punctured convolutional code involves searching for dual words and the puncturing pattern exhaustively.
S. N. Han, M. Zhang, X. H. Li
doaj
Design of high-speed and low-latency Viterbi decoder
Dianzi Jishu Yingyong, 2018 In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences, namely register exchange method and traceback method.
Yang Min
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
Minimality for punctured convolutional codes [PDF]
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002 This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal.
Fragouli, C. +2 more
openaire +2 more sources
A Robust Watermarking Scheme in YCbCr Color Space Based on Channel Coding
IEEE Access, 2019 The rapid development of big data and cloud computing technologies greatly accelerate the spreading and utilization of images and videos. The copyright protection for images and videos is becoming increasingly serious.
Yun Tan +5 more
doaj +1 more source
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
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
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