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

Shortening Array Codes and the Perfect 1 -Factorization Conjecture

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)
Bohossian, V. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA ; Bruck, J.

The existence of a perfect 1-factorization of the complete graph with n nodes, namely, Kn , for arbitrary even number n, is a 40-year-old open problem in graph theory. So far, two infinite families of perfect 1-factorizations have been shown to exist, namely, the factorizations of Kp+1 and K2 p , where p is an arbitrary prime number (p > 2) . It was shown in previous work that finding a perfect 1 -factorization of Kn is related to a problem in coding, specifically, it can be reduced to constructing an MDS (Minimum Distance Separable), lowest density array code. In this paper, a new method for shortening arbitrary array codes is introduced. It is then used to derive the Kp+1 family of perfect 1 -factorization from the K2p family. Namely, techniques from coding theory are used to prove a new result in graph theory-that the two factorization families are related.

Published in:

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

Date of Publication:

Feb. 2009

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.