Unit-Distance Error-Checking Codes

  title={Unit-Distance Error-Checking Codes},
  author={William H. Kautz},
  journal={IRE Trans. Electron. Comput.},
  • W. Kautz
  • Published 1958
  • Computer Science
  • IRE Trans. Electron. Comput.

Topics from this paper

New Bounds for the Snake-in-the-Box Problem
New lower bounds are proved for the values n of the Snake-in-the-Box problem of finding a longest induced path in an n-dimensional hypercube. Expand
Finding Longest Paths in Hypercubes: 11 New Lower Bounds for Snakes, Coils, and Symmetrical Coils
Improved heuristics for Stochastic Beam Search sub-solution selection in searching for longest induced paths: open snakes, closed coils, and symmetric closed symmetric coils; in n-dimensional hypercube graphs are presented. Expand
Graph Algorithms for Constructing and Enumerating Cycles and Related Structures
A new method for enumerating Hamiltonian cycles in general graphs, planar graphs and grid graphs is presented and perfect matchings in the n-cube for n ≤ 7 are enumerated, and new chordless cycles and chordless paths in the 8-cube are discovered and established that they are of maximal length. Expand
Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes
This work proposes a new set of GA operators that solve the snake-in-the-box problem by applying information from the paths (snakes) produced by the population members, and shows the efficacy of this approach by producing a new record length snake of 98 edges in an eight dimensional hypercube. Expand
Extremal Behaviour in Multiagent Contract Negotiation
  • P. Dunne
  • Computer Science
  • J. Artif. Intell. Res.
  • 2005
This paper addresses the issue of the number of restricted rational deals that may be required to implement a particular reallocation when it is possible to do so and constructs examples showing that this number may be exponential, even when all of the agent utility functions are monotonic. Expand
Solving the Snake in the Box Problem with Heuristic Search: First Results
Using the proposed heuristics to solveSnake in the Box is shown to have a huge impact on the number of nodes expanded and, in some configurations, on runtime. Expand
On the Length of Snakes in Powers of Complete Graphs
The conjecture stated in an earlier paper by the author that there is a constant (independent from both and ) such that holds for every and, where is the length of the longest snake (cycle withoutExpand
Exact and approximate algorithms for the longest induced path problem
The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems withExpand
New formulations and branch-and-cut procedures for the longest induced path problem
Given an undirected graph G = (V,E), the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset W ⊆ V such that W induces a simple path in G. In this paper, we proposeExpand
Complexity results for autocatalytic network models.
Although there is a fast algorithm to determine whether or not a catalytic reaction network contains a subset that is both self-sustaining and autocatalytic, determiningWhether or not sets exist that satisfy certain additional constraints exist turns out to be NP-hard. Expand


Unit-Distance Binary-Decimal Codes for Two-Track Commutation
  • H. Tompkins
  • Computer Science
  • IRE Trans. Electron. Comput.
  • 1956
Error detecting and error correcting codes
The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the endExpand