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

Several classes of codes generated from orthogonal functions

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)

A method of designing codes from orthogonal functions utilizing the existing knowledge of discrete error-correcting binary codes is given. The method consists in constructing the transformation matrix,[a_{ij}], that performs the linear transformation by taking the finite set of orthogonal functions into the set of continuous code words. Several classes of code words are found whose transformation matrices[a_{ij}]use symbols0, -1, and1, and each row of which contains equal number of nonzero elements. They are better than the randomly found existing codes in the sense that with the same number of orthogonal functions and distance criterion, more code words can be obtained.

Published in:

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

Date of Publication:

Jan 1964

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.