Weight enumerators of high-rate convolutional codes based on the Hamming code
From MaRDI portal
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}\).
Recommendations
- Cryptography and Coding
- Some convolutional codes whose free distances are maximal
- On the enumeration and generation of nonweight equivalent rate \(\frac12\) convolutional codes
- The Weight Spectra of Some Short Low-Rate Convolutional Codes
- On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes (Corresp.)
Cited in
(12)- WOM-codes construits à partir des codes de Hamming
- Transmission of constant weight binary sequences with convolutional codes and maximum likelihood decoding
- Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers
- On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes (Corresp.)
- The Weight Spectra of Some Short Low-Rate Convolutional Codes
- Dual convolutional codes and the MacWilliams identities
- scientific article; zbMATH DE number 4074965 (Why is no real title available?)
- A note on type II convolutional codes
- scientific article; zbMATH DE number 910959 (Why is no real title available?)
- scientific article; zbMATH DE number 7558354 (Why is no real title available?)
- Cryptography and Coding
- On the enumeration and generation of nonweight equivalent rate \(\frac12\) convolutional codes
This page was built for publication: Weight enumerators of high-rate convolutional codes based on the Hamming code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177492)
