Computational Complexity of Bilinear Forms

Hari Krishna

ISBN 10: 3540176616 / ISBN 13: 9783540176619

Published by Springer Berlin Heidelberg Apr 1987, 1987

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 192 pp. Englisch.

Seller Inventory # 9783540176619

Bibliographic Details

• Title: Computational Complexity of Bilinear Forms
• Publisher: Springer Berlin Heidelberg Apr 1987
• Publication Date: 1987
• Language: English
• ISBN 10: 3540176616
• ISBN 13: 9783540176619
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.