Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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 )