Computational Complexity of Bilinear Forms: Algebraic Coding Theory and Applications to Digital Communication Systems (Lecture Notes in Control and Information Sciences, 94) | EKB DL

EKB DL

Home BookComputational Complexity of Bilinear Forms: Algebraic Coding Theory and Applications to Digital Communication Systems (Lecture Notes in Control and Information Sciences, 94)

Computational Complexity of Bilinear Forms: Algebraic Coding Theory and Applications to Digital Communication Systems (Lecture Notes in Control and Information Sciences, 94)

Description

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.

Keywords

Computers & TechnologyComputer ScienceRoboticsHardware & DIYMicroprocessors & System DesignProgrammingMicrosoft ProgrammingEngineering & TransportationEngineeringElectrical & ElectronicsIndustrial, Manufacturing & Operational SystemsReferenceScience & MathMathematicsAppliedPure MathematicsPhysicsSystem TheorySpecialty BoutiqueNew, Used & Rental Textbooks

1987Book

Author(s)Hari Krishna

PublisherSpringer

ISBN9783540176619

LanguageEnglish

SpringerLink