Results 131 to 140 of about 47,586 (164)

Recursive convolutional codes for time-invariant LDPC convolutional codes

2010 IEEE International Symposium on Information Theory, 2010
In this paper we present an attractive alternative to construct time-invariant Low-Density Parity-Check Convolutional Codes (LDPC-CC) of coding rate-b/c from a simple recursive systematic convolutional encoder design. The proposed Recursive Convolutional Doubly-Orthogonal (RCDO) encoders have a corresponding Tanner graph for which the girth is ...
Eric Roy, Christian Cardinal, David Haccoun   +2 more
openaire   +2 more sources

Signal Codes: Convolutional Lattice Codes

IEEE Transactions on Information Theory, 2011
The coded modulation scheme proposed in this paper has a simple construction: an integer sequence, representing the information, is convolved with a fixed, continuous-valued, finite impulse response (FIR) filter to generate the codeword - a lattice point. Due to power constraints, the code construction includes a shaping mechanism inspired by precoding
Ofir Shalvi, Naftali Sommer, Meir Feder
openaire   +1 more source

Every Convolutional Code is a Goppa Code

IEEE Transactions on Information Theory, 2013
Convolutional Goppa codes (CGC) were defined in Appl. Algebra Eng. Comm. Comput., vol. 15, pp. 51-61, 2004 and IEEE Trans. Inf. Theory, vol. 52, 340-344, 2006. In this paper, we prove that every convolutional code is a CGC defined over a smooth curve over \BBF q(z) and we give an explicit construction of convolutional codes as CGC over the projective ...
José Ignacio Iglesias Curto, Ángel Luis Muñoz Castañeda, José Maria Muñoz Porras, Gloria Serrano Sotelo   +3 more
openaire   +1 more source

Convolutional Coupled Codes

2008
Die vorliegende Arbeit befasst sich mit verkoppelten Faltungscodes - Codes die durch Verkettung von mehreren systematischen äusseren Faltungscodes und mehreren systematischen inneren Blockcodes konstruiert sind, wobei die einzelnen Eingangssequenzen der äusseren Codes verschachtelt werden, bevor sie in die inneren Codes hineingehen.
openaire   +2 more sources

Syndrome Decoding of Convolutional Codes

IEEE Transactions on Communications, 1975
The classical Viterbi decoder recursively finds the trellis path (code word) closest to the received data. Given the received data, the syndrome decoder first forms a syndrome, instead. A recursive algorithm like Viterbi's is used to determine the noise sequence of minimum Hamming weight that can be a possible cause of this syndrome. Given the estimate
Joost Schalkwijk, A. J. Han Vinck
openaire   +2 more sources

On the structure of convolutional and cyclic convolutional codes

IEEE Transactions on Information Theory, 1979
Algebraic convolutional coding theory is considered. It is shown that any convolutional code has a canonical direct decomposition into subcodes and that this decomposition leads in a natural way to a minimal encoder. Considering cyclic convolutional codes, as defined by Piret, an easy application of the general theory yields a canonical direct ...
openaire   +2 more sources

Woven Convolutional Coding

2003
Woven codes are a family of forward error correction codes. They are constructed by combining several convolutional codes in such a manner that the overall code is again a convolutional code. This is a tutorial paper dealing with design aspects of encoding and decoding woven codes.
openaire   +1 more source

On Tail Biting Convolutional Codes

IEEE Transactions on Communications, 1986
In this paper, we introduce generalized tail biting encoding as a means to ameliorate the rate deficiency caused by zero-tail convolutional encoding. This technique provides an important link between quasi-cyclic block and convolutional codes. Optimum and suboptimum decoding algorithms for these codes are described and their performance determined by ...
Howard H. Ma, Jack K. Wolf
openaire   +2 more sources

State Spaces of Convolutional Codes

Designs, Codes and Cryptography, 1997
There are various definitions of convolutional codes and each definition leads to a definition of code state space. In the usual definition of a convolutional code generated by a rational encoding matrix the input sequences can be any Laurent series. It is proved that restricting input sequences to be rational functions or restricting output sequences ...
openaire   +2 more sources

Convolutional Codes and Coherent Sheaves

Applicable Algebra in Engineering, Communication and Computing, 2001
The author uses sheaf theory as a setting for convolutional codes in the sense that coherent sheaves over a projective line play the same role as finite-dimensional linear spaces in the theory of block codes. The author's use of the notion of ``coherent sheaf'' is non-standard, so an appendix is included at the end of the paper to show how the standard
openaire   +1 more source