Login | Register

Computational complexity of bilinear forms-algebraic coding theory and applications to digital communication systems

Title:

Computational complexity of bilinear forms-algebraic coding theory and applications to digital communication systems

Krishna, Hari (1985) Computational complexity of bilinear forms-algebraic coding theory and applications to digital communication systems. PhD thesis, Concordia University.

[img]
Preview
Text (application/pdf)
NL21846.pdf
6MB

Divisions:Concordia University
Item Type:Thesis (PhD)
Authors:Krishna, Hari
Pagination:xvi, 162 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Ph. D.
Date:1985
ID Code:2777
Deposited By: Concordia University Libraries
Deposited On:27 Aug 2009 19:20
Last Modified:23 May 2017 21:59
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top