Patent ID: 11917047
Assignee: nan
Field: Digital communication (Electrical engineering)
Classification: CPC G  H | IPC H

Claim 7:
8. The method of claim 1, further comprising:
wherein the Snail sequence over a two-dimensional key further comprises:
starting with an arbitrary array identified by row address, x, and column address, y, (x,y), and starting with an empty Snail list, list(x,y) one sets bin-1 in List(x,y)−(x,y); and choosing an arbitrary number k of bins to be listed in the Snail sequence, then one sets i=x, j=y, and continues by:
(a) set i=i+1,
check bin (i,j), if it already listed in List(x,y) then set i=i−1, and j=j−1, return to (a);
if bin (i j) is not in List(x,y) then add it: List(x,y)=List(x,y)+(i j);
if List(x,y) includes k bins, terminate the Snail sequence, otherwise:
(b) set j=j+1,
check bin (i j), if it already listed in List(x,y) then set i=i+1, and j=j−1, return to (b);
if bin (i j) is not in List(x,y) then add it: List(x,y)=List(x,y)+(i,j);
if List(x,y) includes k bins, terminate the Snail sequence, otherwise:
(c) set i=i−1,
check bin (i j), if it already listed in List(x,y) then set i=i+1, and j=j+1, return to (c);
if bin (i j) is not in List(x,y) then add it: List(x,y)=List(x,y)+(i,j);
if List(x,y) includes k bins, terminate the Snail sequence, otherwise:
(d) set j=j−1,
check bin (i j), if it already listed in List(x,y) then set i=i−1, and j=j+1, return to (d);
if bin (i j) is not in List(x,y) then add it: List(x,y)=List(x,y)+(i,j);
if List(x,y) includes k bins, terminate the Snail sequence, otherwise go to (a).