Cart (Loading....) | Create Account
Close category search window
 

The minimal covering radius t[15,6] of a six-dimensional binary linear code of length 15 is equal to 4

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Simonis, J. ; Dept. of Math. & Inf., Delft Univ. of Technol., Netherlands

The nonexistence of a binary linear [15,6] code with covering radius 3 is proved by geometrically based arguments. The author also considers the wider application of the techniques

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 5 )

Date of Publication:

Sep 1988

Need Help?


IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.