Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC   |arrow_leftPrevious Article   |  Next Articlearrow_right
Email/Printer Friendly Format  
 

New upper bounds on generalized weights
Ashikhmin, A.   Barg, A.   Litsyn, S.  
Los Alamos Nat. Lab., NM;

This paper appears in: Information Theory, IEEE Transactions on
Publication Date: May 1999
Volume: 45,  Issue: 4
On page(s): 1258-1263
ISSN: 0018-9448
References Cited: 19
CODEN: IETTAW
INSPEC Accession Number: 6255094
Digital Object Identifier: 10.1109/18.761280
Current Version Published: 2002-08-06

Abstract
We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not logged in.
Guests may access Abstract records free of charge.
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
Full Text: PDF (240 KB)
» Buy this document now
»  Learn more about
»  Learn more about
    purchasing articles
    and standards

Rights and Permissions
» Learn More
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |arrow_leftPrevious Article   |  Next Articlearrow_right   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved