Results 1 - 10
of
2,061
Convolutional Codes
- Encyclopedia of Telecommunications
, 2002
"... This article (“Convolutional Codes”) appears in the Wiley ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
This article (“Convolutional Codes”) appears in the Wiley
Iterative decoding of binary block and convolutional codes
- IEEE TRANS. INFORM. THEORY
, 1996
"... Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract
-
Cited by 610 (43 self)
- Add to MetaCart
Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft
Convolutional Codes
, 2013
"... ◮ RNA, noncoding RNA, RNA structure and its significance ◮ RNA structure prediction ◮ Single/Multiple sequence methods ..."
Abstract
- Add to MetaCart
◮ RNA, noncoding RNA, RNA structure and its significance ◮ RNA structure prediction ◮ Single/Multiple sequence methods
Active Distances for Convolutional Codes
"... Abstract — A family of active distance measures for general convolutional codes is defined. These distances are generalizations of the extended distances introduced by Thommesen and Justesen for unit memory convolutional codes. It is shown that the error correcting capability of a convolutional code ..."
Abstract
- Add to MetaCart
Abstract — A family of active distance measures for general convolutional codes is defined. These distances are generalizations of the extended distances introduced by Thommesen and Justesen for unit memory convolutional codes. It is shown that the error correcting capability of a convolutional
The Behavior of Convolutional Codes
, 1995
"... It is well known that a convolutional code can be viewed as a linear system over a finite field. In this paper we develop this viewpoint for convolutional codes using several recent innovations from the systems theory literature. In particular we define codes as behaviors of a set of compact support ..."
Abstract
-
Cited by 63 (17 self)
- Add to MetaCart
It is well known that a convolutional code can be viewed as a linear system over a finite field. In this paper we develop this viewpoint for convolutional codes using several recent innovations from the systems theory literature. In particular we define codes as behaviors of a set of compact
Constructions of MDS-Convolutional Codes
, 1999
"... Maximum distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by methods from algebraic geometry. This paper provides an elemen ..."
Abstract
-
Cited by 21 (11 self)
- Add to MetaCart
Maximum distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by methods from algebraic geometry. This paper provides
2Convolutional Codes
"... The difference between block codes and convolutional codes is the encoding principle. In the block codes, the information bits are followed by the parity bits. In convolutional codes the information bits are spread along the sequence. That means that the convolutional codes map information to code b ..."
Abstract
- Add to MetaCart
The difference between block codes and convolutional codes is the encoding principle. In the block codes, the information bits are followed by the parity bits. In convolutional codes the information bits are spread along the sequence. That means that the convolutional codes map information to code
Multidimensional Convolutional Codes
, 1998
"... In this dissertation some of the theory of multidimensional convolutional codes is developed. Given a finite field, F, consider the polynomial ring R = F[z 1 ; :::; z m ] in m indeterminates over F. An m-dimensional convolutional code of length n is an R-submodule of R n . With this definit ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
In this dissertation some of the theory of multidimensional convolutional codes is developed. Given a finite field, F, consider the polynomial ring R = F[z 1 ; :::; z m ] in m indeterminates over F. An m-dimensional convolutional code of length n is an R-submodule of R n
LDPC Convolutional Codes Based on Braided Convolutional Codes
"... Abstract — We introduce and analyze new constructions of LDPC convolutional codes and their tail-biting versions which are obtained from braided convolutional codes. The basic ideas behind the encoding and decoding architectures for these codes are presented. Additionally, asymptotic results concern ..."
Abstract
- Add to MetaCart
Abstract — We introduce and analyze new constructions of LDPC convolutional codes and their tail-biting versions which are obtained from braided convolutional codes. The basic ideas behind the encoding and decoding architectures for these codes are presented. Additionally, asymptotic results
Results 1 - 10
of
2,061