Referenced Items are not available for this document.
A lower bound for generalized Hamming weights of linear codes is introduced by using the notion of well-behaving. A sufficient condition for t-th rank MDS codes is also given
Published in:
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Date of Conference: 16-21 Aug 1998
- Meeting Date :
- 16 Aug 1998-21 Aug 1998
- Print ISBN:
- 0-7803-5000-6
- INSPEC Accession Number:
- 6175076
- Conference Location :
- Cambridge, MA
- Digital Object Identifier :
- 10.1109/ISIT.1998.708683
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
