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

Graph theoretic q -ary codes (Corresp.)

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)

This correspondence formulatesGF(q)matrix descriptions for a class of weighted, directed graphs. As a result of this formulation, the concept of graph theoretic error-correcting codes is generalized to theq-ary case. It is shown that graph theoreticq-ary codes are completely orthogonalizable and, hence, one-step majority decodable. It is also seen that known techniques for the augmentation of circuit codes can he extended to theq-ary case. The resulting codes remain easily decodable.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 2 )

Date of Publication:

Mar 1971

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.