- Start
- Computational Complexity of Bilinear Forms
Computational Complexity of Bilinear Forms
Angebote / Angebote:
Bilinear forms and linear codes.- Efficient algorithms for the aperiodic convolution of sequences.- A new class of linear codes.- Error-detection and error-correction.- Automatic repeat request systems.- A generalized type-II hybrid ARQ scheme.- Conclusions.
Folgt in ca. 5 Arbeitstagen