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

Local correction of helix(k) lists

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

1 Author(s)
Davis, I.J. ; Dept. of Comput. Sci., Waterloo Univ., Ont., Canada

A helix (k) list is a robust multiply linked list having k pointers in each node. In general, the ith pointer in each node addresses the ith previous node. However, the first pointer in each node addresses the next node, rather than the previous. An algorithm for performing local correction in a helix (k ⩾3) list is presented. Given the assumption that at most k errors are encountered during any single correction step, this algorithm performs correction whenever possible, and otherwise reports failure. The algorithm generally reports failure only if all k pointers addressing a specific node are damaged, causing this node to become disconnected. However, in a helix (k=3) structure, one specific type of damage that causes disconnection is indistinguishable from alternative damage that does not. This also causes the algorithm to report failure

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 5 )

Date of Publication:

May 1989

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.