Open Access
Construction of convolutional codes for sequential decoding
About:
The article was published on 1969-08-01 and is currently open access. It has received 22 citations till now. The article focuses on the topics: Serial concatenated convolutional codes & Convolutional code.read more
Citations
More filters
Journal ArticleDOI
Convolutional codes I: Algebraic structure
TL;DR: Minimal encoders are shown to be immune to catastrophic error propagation and, in fact, to lead in a certain sense to the shortest decoded error sequences possible per error event.
Journal ArticleDOI
Polynomial weights and code constructions
TL;DR: It is shown that the polynomials (x - c)^i, i = 0,1,2,\cdots, have the "weight-retaining" property that any linear combination of these polynmials with coefficients in GF(q) has Hamming weight at least as great as that of the minimum degree polynomial included.
Journal ArticleDOI
Free distance bounds for convolutional codes
TL;DR: An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.
Journal ArticleDOI
Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
TL;DR: In this paper, a search procedure was developed to find good short binary (N,N - 1) convolutional codes using simple rules to discard from the complete ensemble of codes a large fraction whose free distance d{free} either cannot achieve the maximum value or is equal to d_{free} of some code in the remaining set.
A linear algebra approach to minimal convolutional encoders
Rolf Johannesson,Zhe-Xian Wan +1 more
TL;DR: The authors review the work of G.D. Forney, Jr., on the algebraic structure of convolutional encoders and proven that the constraint lengths of two equivalent minimal-basic encoding matrices are equal one by one up to a rearrangement.