IEEE Transactions on Information Theory · 1999 · 10 citations · 5 references
Natural SciencesComputer ScienceCryptographyInformation TheoryOptimizationChannel CodingCoding TheoryConvolutional CodesEncoder DesignEncodersHamming DistanceMinimum DistancePolynomial CodingUpper Bounds
Tabulations of binary systematic and nonsystematic polynomial convolutional encoders with an optimum distance profile for rate 1/2, 1/3, and 1/4 are given. The reported encoders are found by computer searches that optimize over the weight spectra. The free distances for rate 1/3 and 1/4 are compared with Heller's (1968) and Griesmer's (1960) upper bounds.
5
A Bound for Error-Correcting Codes
James H. Griesmer · IBM Journal of Research and Development · 1960 · 405 citations