Weight enumerators of high-rate convolutional codes based on the Hamming code (Q1177492)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weight enumerators of high-rate convolutional codes based on the Hamming code |
scientific article; zbMATH DE number 20609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weight enumerators of high-rate convolutional codes based on the Hamming code |
scientific article; zbMATH DE number 20609 |
Statements
Weight enumerators of high-rate convolutional codes based on the Hamming code (English)
0 references
26 June 1992
0 references
The author considers a class of rate \((n-1)/n\;(n=2^ r,\;r=1,2,\dots)\) binary convolutional codes with free distance \(d_ f=3\) and derives a method for the calculation of their spectra. Moreover she shows that the codes of this class are equivalent to punctured convolutional codes having constraint length \(\leq r+1\) and allow maximum likelihood decoding with complexity of order \(2^{r+1}\).
0 references
Hamming code
0 references
binary convolutional codes
0 references
spectra
0 references
maximum likelihood decoding
0 references
