Fr. 69.00

Computational Complexity of Bilinear Forms - Algebraic Coding Theory and Applications to Digital Communication Systems

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










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.

List of contents

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.

Product details

Authors Hari Krishna
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 15.10.2013
 
EAN 9783540176619
ISBN 978-3-540-17661-9
No. of pages 171
Dimensions 165 mm x 242 mm x 8 mm
Weight 341 g
Illustrations XVII, 171 p.
Series Lecture Notes in Control and Information Sciences
Lecture Notes in Control and Information Sciences
Subject Natural sciences, medicine, IT, technology > Technology > Electronics, electrical engineering, communications engineering

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.