University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A Lower Bound on the Greedy Weights of Product Codes and Projective Multisets

Schaathun, Hans Georg (2001) A Lower Bound on the Greedy Weights of Product Codes and Projective Multisets

[img]
Preview
PDF
fulltext.pdf

Download (122kB)

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)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
AuthorsEmail
Schaathun, Hans Georgh.schaathun@surrey.ac.uk
Date : 1 June 2001
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.
Depositing User : Mr Adam Field
Date Deposited : 27 May 2010 14:46
Last Modified : 23 Sep 2013 18:35
URI: http://epubs.surrey.ac.uk/id/eprint/1928

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800