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

Some new results for optimal ternary linear codes

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)
Bouyukliev, I. ; Inst. of Math.& Inf., Bulgarian Acad. of Sci., Sofia, Bulgaria ; Simonis, J.

Let d3(n,k) be the maximum possible minimum Hamming distance of a ternary [n,k,d]-code for given values of n and k. We describe a package for code extension and use this to prove some new exact values of d3(n,k). Moreover, we classify the ternary [n,k,d3(n,k)]-codes for some values of n and k

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 4 )

Date of Publication:

Apr 2002

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.