A Lower Bound on the Greedy Weights of Product Codes and Projective Multisets
Tools
Tools
Tools
Schaathun, Hans Georg (2001) A Lower Bound on the Greedy Weights of Product Codes and Projective Multisets
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 119Kb |
Abstract
We present the relation between product codes and projective multisets, and give a lower bound on the greedy weights of product codes.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | A lower bound on the greedy weights of product codes and projective multisets. 2001 IEEE International Symposium on Information Theory, 2001. Proceedings. Publication Date: 2001.page: 120. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 1928 |
| Deposited By: | Mr Adam Field |
| Deposited On: | 27 May 2010 15:46 |
| Last Modified: | 26 Sep 2012 14:37 |
Document Downloads
Repository Staff Only: item control page