We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On a new binary [22,13,5] code

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

3 Author(s)
Zhi Chen ; Dept. of Comput. Sci. & Eng., Southwest Jiaotong Univ., Sichuan, China ; Pingzhi Fan ; Fan Jin

A new binary [22,13,5] quasi-perfect code is presented. The weight distributions of the coset codes are given. The code obtained is not equivalent to T.J. Wagner's code (1966). Four lower bounds for constant weight codes can be derived from it, which are better than the codes with the same parameters in R.L. Graham and N.J. Sloane (1980) and A.E. Brouwer et al. (1980)

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 1 )