IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Information Theory, IEEE Tran ...> Volume:27 Issue:6 Help

On the complexity of some coding problems (Corresp.)

Full Text Sign-In or Purchase

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

2 Author(s)
Ntafos, S.C. ; Hakimi, S.L.

It is shown that the problem of finding a codeword with least weight and whose weight is not a multiple ofkin a binary linear code belongs to the class of "nondeterministic polynomial (NP)-hard" problems for anykgeq 2. Some other related problems are shown to belong to the same class. These results were motivated by a conjecture due to Berlekamp, McEliece, and van Tilborg that the problem of finding the Hamming distance of a code is NP-hard.

Published in:
Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 6 )

Date of Publication: Nov 1981

Page(s):
794 - 796
ISSN :
0018-9448
Digital Object Identifier :
10.1109/TIT.1981.1056419
Product Type:
Journals & Magazines
Date of Current Version :
06 January 2003
Issue Date :
Nov 1981
Sponsored by :
IEEE Information Theory Society

IEEE Account

Purchase Details

Profile Information

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