Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
zbMath0624.94001MaRDI QIDQ579215
Publication date: 1987
Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)
computational complexityFourier transformsbilinear formsGalois fieldchannels having non- stationary error ratescodes with adaptive error-correcting capabilitiesdecoding complexitydesign and analysis of coding schemesdigital communication systemsefficient algorithms for aperiodic convolutionserror control scheme
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear codes (general theory) (94B05) Galois theory (11S20) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Other types of codes (94B60) Communication theory (94A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) General binary quadratic forms (11E16)
Related Items (1)
This page was built for publication: Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
