Journal ArticleDOI
A construction technique for random-error-correcting convolutional codes
TLDR
It is shown how the above algorithm can be modified slightly to produce codes with known free distance, and a comparison of probability of error with sequential decoding is made among the best known constructive codes of constraint length.Abstract:
A simple algorithm is presented for finding rate 1/n random-error-correcting convolutional codes. Good codes considerably longer than any now known are obtained. A discussion of a new distance measure for convolutional codes, called the free distance, is included. Free distance is particularly useful when considering decoding schemes, such as sequential decoding, which are not restricted to a fixed constraint length. It is shown how the above algorithm can be modified slightly to produce codes with known free distance. A comparison of probability of error with sequential decoding is made among the best known constructive codes of constraint length 36 .read more
Citations
More filters
Book
Algebraic Codes for Data Transmission
TL;DR: This paper presents codes and algorithms for majority decoding based on the Fourier transform, as well as algorithms based on graphs, for linear block codes and beyond BCH codes.
Journal ArticleDOI
On Tail Biting Convolutional Codes
H. Ma,Jack K. Wolf +1 more
TL;DR: This technique provides an important link between quasi-cyclic block and convolutional codes andOptimum and suboptimum decoding algorithms for these codes are described and their performance determined by analytical and simulation techniques.
Journal ArticleDOI
Strongly-MDS convolutional codes
TL;DR: A class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earliest possible instant, called strongly-MDS convolutionsal codes.
Proceedings Article
A fast algorithm for computing distance spectrum of convolutional codes
Mats Cedervall,Rolf Johannesson +1 more
TL;DR: In this paper, a fast algorithm for searching a tree (FAST) was presented for computing the distance spectrum of convolutional codes, which can be easily modified to determine the number of nonzero information bits of an incorrect path as well as the length of an error event.
References
More filters
Journal ArticleDOI
Some properties of binary convolutional code generators
TL;DR: This paper formalizes the discussion of some structural properties of the generators for binary convolutional codes and introduces the notion of "adjoint" canonical generators, all of which have the same error-correcting properties but different message sets.
Journal ArticleDOI
Some results on binary convolutional code generators (Corresp.)
Journal ArticleDOI
Error propagation and definite decoding of convolutional codes
TL;DR: A decoding method having no internal feedback, definite decoding (DD), is formalized and it is shown that a code using FD with limited L exists if and only if that same code can be decoded using DD.
Some algebraic and distance properties of convolutional codes.
TL;DR: Upper and lower bounds for feedback decoding and definite decoding minimum distances of binary convolutional codes and their values are compared to previous work on similar topics.