It is shown that any rate l/b systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow “decoding” of a received sequence in its unquantized analog form
Several structural and distance properties of the class of codes are derived and utilized in develop...
International Telemetering Conference Proceedings / November 19-21, 1979 / Town and Country Hotel, S...
Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is charact...
Generalized tail-biting (GTB) convolutional encoding has been presented as a means to ameliorate the...
"April 5, 1963." Issued also as a thesis, M.I.T. Dept. of Electrical Engineering, August 20, 1962.Bi...
A new decoding algorithm for some convolutional codes constructed from block codes is given. The alg...
Contains report on one research project.National Aeronautics and Space Administration (Grant NsG-334
Some new techniques to derive convolutional codes from block codes are given. The techniques given r...
In this paper we present the analytical results of the computational requirement for the minimum-dis...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
International Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los A...
This paper describes a least complex, high speed decoding method named multi-stage threshold decodin...
In this paper we extend the coding technique for the 1 - D channel, due to Wolf and Ungerboeck, to t...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
It is well known that there is a correspondence between convolutional codes and discrete-time linear...
Several structural and distance properties of the class of codes are derived and utilized in develop...
International Telemetering Conference Proceedings / November 19-21, 1979 / Town and Country Hotel, S...
Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is charact...
Generalized tail-biting (GTB) convolutional encoding has been presented as a means to ameliorate the...
"April 5, 1963." Issued also as a thesis, M.I.T. Dept. of Electrical Engineering, August 20, 1962.Bi...
A new decoding algorithm for some convolutional codes constructed from block codes is given. The alg...
Contains report on one research project.National Aeronautics and Space Administration (Grant NsG-334
Some new techniques to derive convolutional codes from block codes are given. The techniques given r...
In this paper we present the analytical results of the computational requirement for the minimum-dis...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
International Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los A...
This paper describes a least complex, high speed decoding method named multi-stage threshold decodin...
In this paper we extend the coding technique for the 1 - D channel, due to Wolf and Ungerboeck, to t...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
It is well known that there is a correspondence between convolutional codes and discrete-time linear...
Several structural and distance properties of the class of codes are derived and utilized in develop...
International Telemetering Conference Proceedings / November 19-21, 1979 / Town and Country Hotel, S...
Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is charact...