Author: claimsbot

1. A high visibility garment comprising:
(a) front and back luminescent panels that extend from the shoulders to the waist and hip region;
(b) detachable fastener means in the vicinity of said shoulders and in the vicinity of said hips connecting said front and back luminescent panels; and
(c) retro-reflective bands spanning said front luminescent panel and said back luminescent panel;
(d) whereby said front luminescent panel and said back luminescent panel are separable when one andor the other is grasped and pulled.
2. The garment of claim 1 wherein said retroreflective bands define regions for the reception of graphic visual matter.
3. The garment of claim 1 wherein lengths of trim visually bound said bands, and visually bound free edges of said panels.
4. The garment of claim 1 wherein lengths of trim visually bound said bands and visually bound said panels, said lengths of trim being substantially equal in transverse width throughout.
5. The garment of claim 1 wherein said fastener means include micro hook-and loop strips.
6. The garment of claim 1 wherein said fastener means include mating series of male and female snaps.
7. The garment of claim 1 wherein said fastener means include mating series of buttons and buttonholes.
8. The garment of claim 1 wherein said fastener means include stay stitching.
9. The garment of claim 1 wherein said panels are fabricated from fibers composed of a polymer selected from the class consisting of polyester and polypropylene.
10. The garment of claim 1 wherein said panels are fabricated substantially from a fabric composed of polymeric fibers selected from the class consisting of polyesters and polypropylenes, said fabric having a denier ranging from 70 to 500 and a weight ranging from 2 to 6 ounces per square yard.
11. A high visibility garment comprising:
(a) front and back luminescent panels;
(b) detachable fastener means at the shoulders and the waist and hip region connecting said front and back panels;
(c) upper and lower retro-reflective bands spanning said front panel;
(d) upper and lower retro-reflective bands spanning said back panel;
(e) said upper and lower retro-reflective bands defining regions that include graphic visual matter;
(f) retro-reflective bands extending from said upper retro-reflective band on said front panel to said shoulders on said front panel;
(g) retro-reflective bands extending from said upper retro-reflective band on said back panel to said shoulders on said back panel; and
(g) lengths of trim distinctively bounding said bands, and distinctively bounding free edges of said panels.
12. The garment of claim 11 wherein said fastener means include mating micro hook-and-loop strips.
13. The garment of claim 11 wherein said fastener means include mating series of male and female snaps.
14. The garment of claim 11 wherein said fastener means include mating series of buttons and buttonholes.
15. The garment of claim 11 wherein said fastener means include stay stitching.
16. The garment of claim 11 wherein said panels are fabricated from woven or knit fibers composed of a polymer selected from the class consisting of polyester and polypropylene.
17. The garment of claim 11 wherein said panels are fabricated from woven or knit polymeric fabric with fibers composed of a polymer selected from the class consisting of polyesters and polypropylenes, said fabric having a denier ranging from 70 to 500 and a weight ranging from 2 to 6 ounces per square yard.
18. A high visibility garment which is to be worn over regular or service clothing, said vest comprising:
(a) a front panel and back panel that extend about the body;
(b) hook-and-loop micro-meshing strips at the upper body and the lower body detachably connecting said front panel and said back panel;
(c) a front lower retro-reflective band and a front upper retro-reflective band horizontally spanning body locations in substantial parallel;
(d) a back lower retro-reflective band and a back upper retro-reflective band horizontally spanning body locations in substantial parallel;
(e) retro-reflective bands on said front panel extending between said front upper horizontal band and strategic locations at said shoulders;
(f) retro-reflective bands on said back panel extending between said back upper horizontal band and strategic locations at said shoulders;
(g) said micro-meshing strips at each of said shoulders including a first mating strip that is sewn to an upper edge of said front panel, and a second mating strip that is sewn to an upper edge of said back panel;
(h) said lower back retro-reflective band being provided with opposed extensions that loop forwardly about said body and are fastened by said lower micro-meshing strips to the outer ends of the front retro-reflective band at said lower body;
(i) said opposed extensions having retro-reflective bands that visually are continuations of said lower back retro-reflective band and said lower front retro reflective band;
(j) matching trim being provided at free edges of said front panel and said back panel by thin selvedges, said matching trim being reversely bent about said free edges; and
(k) matching trim being provided at opposed longitudinal edges of said retro-reflective bands by underlying backing that extends oppositely beyond said opposed longitudinal edges of said bands;
(l) said front panel and said back panel being composed of a fabric composed of knit or woven strands of polyester or polypropylene, and are characterized by a denier ranging from 70 to 500 and a weight ranging from 2 to 6 ounces per square yard;
(m) said fabric being treated with a high chromaticity, high luminosity fluorescent dye;
(n) said vest being effectively vivid in operation, and said mating fastener strips being easily separated as a safety measure when needed;
(o) longitudinal edges of certain of said retro-reflective bands being stitched to said front panel;
(p) longitudinal edges of certain of said retro-reflective bands being stitched to said back panel;
(q) longitudinal edges of said retro-reflective bands being stitched to said underlying backing and said retro reflective bands.
19. The garment of claim 18 wherein said upwardly extending retro reflective bands on said front panel are crossed.
20. A high visibility garment, said garment comprising:
(a) a front panel and a back panel that extend substantially from the shoulders substantially to the waist and hip region;
(b) hook-and-loop micro-meshing strips at said shoulders and said hips detachably connecting said front panel and said back panel;
(c) front retro-reflective bands spanning the chest;
(d) back retro-reflective bands spanning the back;
(e) said micro-meshing strips at each of said shoulders including a first mating strip that is sewn to a an upper edge of one of said panels, and a second mating strip that is sewn to an upper edge of the other of said panels;
(f) matching trim at free edges of said front panel and said back panel being presented by trim fabric that is reversely bent about said free edges; and
(g) matching trim at opposed longitudinal edges of said retro-reflective bands being presented by backing fabric that extends oppositely beyond said opposed longitudinal edges of said retro-reflective bands;
(h) said front panel and said back panel being fabricated from strands of polyester or polypropylene, and being characterized by a denier ranging from 70 to 500 and a weight ranging from 2 to 6 ounces per square yard;
(i) said fabric of said front panel and of said back panel being treated with a high chromaticity, high luminosity fluorescent dye;
(j) said vest being effectively vivid in operation, and being easily ripped from a wearer for safety when needed.
21. A garment comprising:
(a) a front section and a back section; said front section having free edges;
(b) at least one retro-reflective band on at least one of said sections;
(c) trim at certain of said free edges and at certain of said bands;
(d) said trim at said certain of said free edges being provided by an overlapping selvedge that is reversely about said certain of said free edges;
(e) said trim at said certain of said bands being provided by an underlying backing that extends oppositely beyond the edges of the band;
(f) the widths of said trim at said free edges and of said trim at said edges of said band being substantially equal for aesthetic harmony.
22. An elongated visual band for affixation to clothing, said band comprising:
(a) a discrete elongated front stratum and a discrete elongated back stratum;
(b) said front stratum being retro-reflective;
(c) said back stratum being diffusely reflective;
(d) said back stratum extending transversely beyond the longitudinal edges of said front stratum to provide visual trim.
23. A high visibility garment, said garment comprising:
(a) a front panel and a back panel that extend substantially from the shoulders substantially to the waist and hip region;
(b) front retro-reflective bands on said front panel;
(c) back retro-reflective bands on said back panel;
(d) first trim at free edges of said front panel and said back panel being presented by trim fabric that is reversely bent about said free edges; and
(e) second trim at opposed longitudinal edges of said retro-reflective bands being presented by backing fabric that extends oppositely beyond said opposed longitudinal edges of said retro-reflective bands;
(f) said first trim and said second trim being of substantially the same color;
(g) said fabric of said front panel and of said back panel being highly luminous.
24. A high visibility garment, said garment comprising:
(a) a front panel and a back panel that extend substantially from the shoulders substantially to the waist and hip region;
(b) front retro-reflective bands spanning the chest;
(c) back retro-reflective bands spanning the back;
(d) first trim at free edges of said front panel and said back panel being presented by trim fabric that is reversely bent about said free edges; and
(e) second trim at opposed longitudinal edges of said retro-reflective bands being presented by backing fabric that extends oppositely beyond said opposed longitudinal edges of said retro-reflective bands;
(f) said first trim and said second trim being of substantially the same color;
(g) said fabric of said front panel and of said back panel being highly luminous.
25. A high visibility garment, said garment comprising:
(a) a front panel and a back panel that extend substantially from the shoulders substantially to the waist and hip region;
(b) front retro-reflective bands bounding an alphanumeric presentation at the chest;
(c) back retro-reflective bands bounding an alphanumeric presentation at the back;
(d) first trim at free edges of said front panel and said back panel: and
(e) second trim at opposed longitudinal edges of said retro-reflective bands;
(f) said first trim and said second trim being of substantially the same color;
(g) said fabric of said front panel and of said back panel being treated with a high luminosity fluorescent dye.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A life saver buoy comprising a ring in combination with a life line, said ring having a central opening therein, said ring having an outer periphery, said outer periphery having a groove therein, said groove being directed inwardly toward said central opening, said groove forming a receptacle for winding a said life line around said ring and into said groove.
2. The life saver buoy of claim 1 including a bore directed into said groove and toward said central opening, said bore having an enlargement at the inner periphery of said ring.
3. The life saver buoy of claim 2, wherein one end of a life line is passed through said bore and a knot at an said one end of said life line is placed into said enlargement.
4. The life saver buoy of claim 1 including a handle at a distal end of said life line.
5. The life saver buoy of claim 4, wherein said handle is of a box-like configuration containing a fastening knot therein.
6. The life saver buoy of claim 4 including a strap for fastening said handle around and against said ring.
7. The life saver buoy of claim 6, wherein ends of said strap comprise hooks and loops fasteners for fastening said ends to each other after having been placed around said ring.

What is claimed is

1. A method for use in transmitting information over a network from a first node to a second node, said method comprising the steps of:
dividing, at said first node, a given transmission into a plurality of information packets;
generating at least one parity packet at said first node with a content based on a selected number of said plurality of information packets and transmitting the at least one parity packet with the plurality of information packets;
detecting, at said second node, arrival of said plurality of information packets as well as any problems which may exist relative to any of said plurality of information packets, said problems including one or more of packet loss and packet damage; and
based on the detection of problems relative to said plurality of information packets, regenerating at least one of said plurality of information packets using a combination of said at least one parity packet and said information transmission packets.
2. A method as set forth in claim 1, further including the step of creating a chunk from transmission packets, wherein the transmission packets include said plurality of information packets and said at least one parity packet.
3. A method as set forth in claim 2, wherein said at least one parity packet within the chunk has a payload length at least as great as the payload length of the longest information packet in the selected number of said plurality of information packets.
4. A method as set forth in claim 1, wherein said step of generating at least one parity packet comprises determining each bit in a payload portion of said parity packet as a function of corresponding bits in at least two of said plurality of information packets.
5. A method as set forth in claim 4, wherein the bits in the payload portion of said parity packet are determined by performing an XOR operation between the corresponding bits in at least two of said plurality of information packets.
6. A method as set forth in claim 2, wherein said network comprises a packet switched network for switching protocol compliant packets including a payload portion and a header, and said method further comprises the steps of establishing a plurality of protocol compliant packets, the payload portion for each of said plurality of protocol compliant packets including a content of a corresponding one of the transmission packets in the chunk.
7. A method as set forth in claim 1, wherein said network comprises an internet protocol network.
8. A method as set forth in claim 7, wherein said plurality of information packets and said at least one parity packet are transmitted in accordance with UDP.
9. A method as set forth in claim 1, wherein said step of detecting a problem comprises transmitting said plurality of information packets and said at least one parity packet using a transmission system which incorporates a packet integrity checking mechanism.
10. A method as set forth in claim 1, further comprising the step of associating check parameters with each of said plurality of information packets and said at least one parity packet, wherein said step of detecting comprises analyzing said check parameters to identify said problems.
11. A method as set forth in claim 1, wherein the detection of any problems relative to the plurality of information packets includes determining that any of said plurality of information and parity packets has not been received within an allowed time.
12. A method as set forth in claim 1, wherein said given transmission comprises one of a video transmission and an audio transmission.
13. A method as set forth in claim 2, further comprising the steps of:
including in the chunk up to (2N1) of the plurality of information packets and the parity packets, where N is an integer greater than 2 and N packets within the chunk are the parity packets;
transmitting the chunk over said network from said first node to said second node; and
processing the chunk at said second node to obtain up to (2N1)-N of said plurality of information packets.
14. A method as set forth in claim 13, wherein when N is equal to 3, full information recovery can be achieved for cases where one or two of the transmission packets within one of the chunks are lost during transmission and full recovery can be achieved for at least 77 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission.
15. A method as set forth in claim 13, wherein when N is equal to 4, full information recovery can achieved for all cases where two or less of the transmission packets within one of the chunks are lost during the transmission, full recovery can be achieved for at least 90 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission, and full recovery can be achieved for at least 60 percent of the cases in which four of the transmission packets within one of the chunks are lost during the transmission.
16. A method as set forth in claim 13, wherein when N is equal to 5, full information recovery can be achieved for all cases where two or less of the transmission packets within one of the chunks are lost during the transmission, fill recovery can be achieved for at least 95 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission, fill recovery can be achieved for at least 80 percent of the cases in which four of the transmission packets with one of the chunks are lost during the transmission, and full information recovery can be achieved for at least 45 percent of the cases in which five of the transmission packets within one of the chunks are lost during the transmission.
17. A method as set forth in claim 13, wherein said N parity packets are established according to the following rules:
1) each of said plurality of information packets participates in establishing at least two of said N parity packets; and
2) each of said N parity packets is generated through use of a unique combination of said plurality of information packets.
18. A method as set forth in claim 2, further comprising the steps of:
including in the chunk N1 of the plurality of information packets and the parity packets, where N is an integer greater than 1 and one parity packet is included within the chunk;
transmitting the chunk over said network from said first node to said second node; and
processing the chunk at said second node to obtain N of said plurality of information packets.
19. A method as set forth in claim 2, further comprising the step of forming one or more superchunks, each of the superchunks including a plurality of the chunks, wherein the transmission packets for all of the chunks are interleaved within the superchunk.
20. A method as set forth in claim 19, wherein the transmission packets of the chunks are interleaved to form the superchunk, and the number of the chunks used to form the superchunk may be changed at the first node.
21. A method as set forth in claim 2, wherein said transmission packets include a header portion and a payload portion, said header portion including identifying information sufficient to identify whether a packet is one of said information packets or said parity packets and to uniquely identify each of said information packets and each of said parity packets.
22. A method as set forth in claim 2, wherein said at least one chunk comprises a plurality of chunks and the header portion of said transmission packets within each of the chunks includes:
a sequence number to identify the chunk said transmission packet is contained within, and to identify a payload for the chunk
a packet payload length to identify a length of a payload portion of said packet;
a parity type (redtype) identifier to identify a type of parity used in the chunk, to identify a total number of packets within the chunk, and to identify a total number of the parity packets within the chunk; and
a packet number identifier which uniquely identifies a particular one of the transmission packets within the chunk.
23. A method as set forth in claim 22, wherein said redtype identifier identifies one of the following types of parity within said chunk:
a first parity where the chunk includes none of said parity packets;
a second parity where the chunk includes one of said parity packets and N of said information packets, where N is an integer equal to or greater than 2; and
a third parity where the chunk includes N of said parity packets, where N is an integer equal to or greater than 3 and the chunk includes at least 3 and at most (2N1)-N of the information packets.
24. A method as set forth in claim 2, wherein said at least one chunk comprises a plurality of chunks, said method further comprising the step of transmitting an acknowledgment from the second node to the first node upon receipt of a portion of the chunk, where the acknowledgment contains information that includes retransmission requirements for the chunks previously transmitted from the first node.
25. A method as set forth in claim 24, wherein the first node retransmits all or a portion of the chunk based on at least one of the information contained in the acknowledgment, and nonreceipt of the acknowledgment within an allowed amount of time.
26. A method as set forth in claim 22, wherein the redtype may be changed.
27. A method as set forth in claim 20, wherein the number of the transmission chunks within the superchunk may be changed.
28. A method as set forth in claim 26, wherein the changing of the redtype includes switching between the first, second, and third parities.
29. A method as set forth in claim 26, wherein the changing of the redtype includes changing the N value in the second and third parities.
30. A method as set forth in claim 26, wherein the redtype is changed dynamically based on at least one of: the information in the acknowledgments received from the chunks previously transmitted and nonreceipt of the acknowledgment within an allowed time.
31. A method as set forth in claim 27, wherein the number of chunks in a superchunk is changed dynamically based on at least one of: the information in the acknowledgments received from the chunks previously transmitted and nonreceipt of the acknowledgment with an allowed time.
32. A method as set forth in claim 23, wherein said header portion of at least two of said transmission packets within each of the chunks contains:
the redtype indicating the second parity;
a chunk length defining a length of information contained in the chunk;
a window size associated with an amount of available receive buffer in a node from which the chunk has been transmitted from;
an acknowledgment flag and identifier, which when the flag is ON the identifier corresponds to a sequence number of information successfully received from a node to which the chunk is being transmitted;
a time stamp value corresponding to a transmission time associated with the chunk; and
a time stamp echo value which, when said acknowledgment flag is ON, contains a time stamp value assigned by the node to which the chunk is being transmitted and associated with said acknowledgment identifier.
33. A method as set forth in claim 23, wherein said header portion of at least three of said transmission packets within each of the chunks includes:
the redtype indicating the third parity;
a chunk length defining a length of information contained in the chunk;
a window size associated with an amount of available receive buffer in a node from which the chunk has been transmitted from;
an acknowledgment flag and identifier, which when the flag is ON the identifier corresponds to a sequence number of information successfully received from a node to which the chunk is being transmitted;
a time stamp value corresponding to a transmission time associated with the chunk; and
a time stamp echo value which, when said acknowledgment flag is ON, contains a time stamp value assigned by the node to which the chunk is being transmitted and associated with said acknowledgment identifier.
34. A method as set forth in claim 1, further comprising the step of restricting a number of said information and parity packets sent in a given time interval so as not to exceed a predetermined packet count.
35. A method as set forth in claim 1, further comprising the step of restricting a number of said information and parity packets sent in a given time interval so as not to exceed a predetermined bit rate.
36. A method for transmitting information over a data network comprising the steps of:
dividing a given transmission into a plurality of information packets;
generating at least one parity packet with a content based on a selected number of said plurality of information packets and including the at least one parity packet with the plurality of information packets; and
transmitting the plurality of information packets and the at least one parity packet over the data network.
37. A method as set forth in claim 36, further including the step of creating a chunk from transmission packets, wherein the transmission packets include said plurality of information packets and said at least one parity packet.
38. A method as set forth in claim 37, wherein said at least one parity packet with the chunk has a payload as least as long as the payload of the information packet in the selected number of said plurality of information packets which is longest in length.
39. A method as set forth in claim 36, wherein said step of generating at least one parity packet comprises determining each bit in a payload portion of said parity packet as a function of corresponding bits in at least two of said plurality of information packets.
40. A method as set forth in claim 39, wherein the bits in the payload portion of said parity packet are determined by performing an XOR operation between the corresponding bits in at least two of said plurality of information packets.
41. A method as set forth in claim 37, further comprising the step of including in the chunk (2N1) of the plurality of information packets and the parity packets, where N is an integer greater than 2 and N packets within the chunk are the parity packets.
42. A method as set forth in claim 41, wherein said N parity packets are established according to the following rules:
1) each of said plurality of information packets participates in establishing at least two of said N parity packets; and
2) each of said N parity packets is generated through use of a unique combination of said plurality of information packets.
43. A method as set forth in claim 37, further comprising the step of including in the chunk N1 of the plurality of information packets and the parity packets, where N is an integer greater than 1 and one parity packet is included within the chunk.
44. A method as set forth in claim 37, further comprising the step of forming one or more superchunks, each of the superchunks including a plurality of the chunks, wherein the transmission packets for all of the chunks are interleaved within the superchunk.
45. A method as set forth in claim 44 wherein the transmission packets of the chunks are interleaved to form the superchunk, and the number of the chunks used to form the superchunk may be changed.
46. A method as set forth in claim 37, wherein said transmission packets include a header portion and a payload portion, said header portion including identifying information sufficient to identify whether a packet is one of said information packets or said parity packets and to uniquely identify each of said information packets and each of said parity packets.
47. A method as set forth in claim 46, wherein the header portion of said transmission packets within each of the chunks includes:
a sequence number to identify the chunk said transmission packet is contained within, and to identify a payload for the chunk;
a packet payload length to identify a length of a payload portion of said packet;
a parity type (redtype) identifier to identify a type of parity used in the chunk, to identify a total number of packets within the chunk, and to identify a total number of the parity packets within the chunk; and
a packet number identifier which uniquely identifies a particular one of the transmission packets within the chunk.
48. A method as set forth in claim 47, wherein said redtype identifier identifies one of the following types of parity within said chunk:
a first parity where the chunk includes none of said parity packets;
a second parity where the chunk includes one of said parity packets and N of said information packets, where N is an integer equal to or greater than 2; and
a third parity where the chunk includes N of said parity packets, where N is an integer equal to or greater than 3 and the chunk includes at least 3 and at most (2N1)-N of the information packets.
49. A method as set forth in claim 48, wherein the redtype may be changed.
50. A method as set forth in claim 48, further comprising the step of forming one or more superchunks, each of the superchunks including a plurality of the chunks, wherein the transmission packets for all of the chunks are interleaved within the superchunk and wherein the number of the transmission chunks within the superchunk may be changed.
51. A method as set forth in claim 48, wherein the redtype is changed dynamically based on at least one of: the information in the acknowledgments received from the chunks previously transmitted and nonreceipt of the acknowledgment within an allowed time.
52. A method as set forth in claim 50, wherein the number of chunks in a superchunk is changed dynamically based on at least one of: the information in the acknowledgments received from the chunks previously transmitted and nonreceipt of the acknowledgment with an allowed time.
53. A method as set forth in claim 48, wherein said header portion of at least two of said transmission packets within each of the chunks contains:
the redtype indicating the second parity;
a chunk length defining a length of information contained in the chunk;
a window size associated with an amount of available receive buffer in a node from which the chunk has been transmitted from;
an acknowledgment flag and identifier, which when the flag is ON the identifier corresponds to a sequence number of information successfully received from a node to which the chunk is being transmitted;
a time stamp value corresponding to a transmission time associated with the chunk; and
a time stamp echo value which, when said acknowledgment flag is ON, contains a time stamp value assigned by the node to which the chunk is being transmitted and associated with said acknowledgment identifier.
54. A method as set forth in claim 48, wherein said header portion of at least three of said transmission packets within each of the chunks includes:
the redtype indicating the third parity;
a chunk length defining a length of information contained in the chunk;
a window size associated with an amount of available receive buffer in a node from which the chunk has been transmitted from;
an acknowledgment flag and identifier, which when the flag is ON the identifier corresponds to a sequence number of information successfully received from a node to which the chunk is being transmitted;
a time stamp value corresponding to a transmission time associated with the chunk; and
a time stamp echo value which, when said acknowledgment flag is ON, contains a time stamp value assigned by the node to which the chunk is being transmitted and associated with said acknowledgment identifier.
55. A method for regenerating at least one information packet transmitted over a data network, comprising:
receiving a plurality of information packets and at least one parity packet, said parity packet having a content based on said information packets;
detecting any problems which may exist relative to any of said plurality of information packets which were originally transmitted, said problems including one of packet loss and packet damage; and
based on the detection of problems relative to said plurality of information packets, regenerating at least one of said plurality of information packets using a to combination of said at least one parity packet and said information transmission packets.
56. A method as set forth in claim 55, wherein said step of detecting comprises analyzing check parameters associated with said information packets to identify said problems.
57. A method as set forth in claim 55, wherein the detection of any problems relative to the plurality of information packets includes determining that any of said plurality of information and parity packets has not been received within an allowed time.
58. A method as set forth in claim 55, wherein said information packets and at least one parity packet (collectively transmission packets) define a chunk including 2N1 transmission packets of which N packets are parity packets, and said method further includes the step of processing the chunk to obtain up to (2N1)-N of said plurality of information packets.
59. A method as set forth in claim 58, wherein when N is equal to 3, full information recovery can be achieved for cases where one or two of the transmission packets within one of the chunks are lost during transmission and full recovery can be achieved for at least 77 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission.
60. A method as set forth in claim 58, wherein when N is equal to 4, full information recovery can be achieved for all cases where two or less of the transmission packets within one of the chunks are lost during the transmission, full recovery can be achieved for at least 90 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission, and full recovery can be achieved for at least 60 percent of the cases in which four of the transmission packets within one of the chunks are lost during the transmission.
61. A method as set forth in claim 58, wherein when N is equal to 5, full recovery is achieved for all cases where two or less of the transmission packets within one of the chunks are lost during the transmission, full recovery can be achieved for at least 95 percent of the cases in which three of the transmission packets within one of the chunks are lost during the transmission, full recovery can be achieved for at least 80 percent of the cases in which four of the transmission packets with one of the chunks are lost during the transmission, and full recovery can be achieved for at least 45 percent of the cases in which five of the transmission packets within one of the chunks are lost during the transmission.
62. A method as set forth in claim 55, wherein the step of regenerating includes performing an XOR operation between corresponding bits in a payload portion of the received information and parity packets.
63. An apparatus for transmitting information over a data network comprising:
means for dividing a given transmission into a plurality of information packets;
means for generating at least one parity packet with a content generated from a selected number of said plurality of information packets, and including the at least one parity packet with the plurality of information packets; and
means for transmitting the plurality of information packets and the at least one parity packet over the data network.
64. An apparatus as set forth in claim 63, further including a means for creating a chunk from transmission packets, wherein the transmission packets include said plurality of information packets and said at least one parity packet.
65. An apparatus as set forth in claim 63, wherein said means for generating at least one parity packet includes means for determining each bit in a payload portion of said parity packet as a function of corresponding bits in at least two of said plurality of information packets.
66. An apparatus as set forth in claim 63, wherein the means for generating at least one parity packet includes means for determining the bits in the payload portion of said parity packet by performing an XOR operation between the corresponding bits in at least two of said plurality of information packets.
67. An apparatus as set forth in claim 64, wherein the means for creating the chunk includes means for combining up to (2N1) of the plurality of information packets and the parity packets in the chunk, where N is an integer greater than 2 and N packets within the chunk are the parity packets.
68. An apparatus as set forth in claim 67, wherein said means for generating at least one parity packet comprises processing means for generating said N parity packets according to the following rules:
1) each of said plurality of information packets participates in establishing at least two of said N parity packets; and
2) each of said N parity packets is generated through use of a unique combination of said plurality of information packets.
69. An apparatus as set forth in claim 64, wherein the means for creating a chunk comprises means for combining N1 of the plurality of information packets and the parity packets in the chunk, where N is an integer greater than 1 and one parity packet is included within the chunk;
70. An apparatus as set forth in claim 64, further including means for forming one or more superchunks, where each of the superchunks includes a plurality of the chunks and the transmission packets for all of the chunks are interleaved within the superchunk.
71. An apparatus as set forth in claim 64, further including means for adding a header portion to said transmission packets wherein said header portion includes identifying information sufficient to identify whether a packet is one of said information packets or said parity packets and to uniquely identify each of said information packets and each of said parity packets.
72. An apparatus as set forth in claim 71, wherein the header portion of said transmission packets within each of the chunks includes:
a sequence number to identify the chunk said transmission packet is contained within, and to identify a payload for the chunk;
a packet payload length to identify a length of a payload portion of said packet;
a parity type (redtype) identifier to identify a type of parity used in the chunk, to identify a total number of packets within the chunk, and to identify a total number of the parity packets within the chunk; and
a packet number identifier which uniquely identifies a particular one of the transmission packets within the chunk.
73. An apparatus as set forth in claim 72, wherein said redtype identifier identifies one of the following types of parity within said chunk:
a first parity where the chunk includes none of said parity packets;
a second parity where the chunk includes one of said parity packets and N of said information packets, where N is an integer equal to or greater than 2; and
a third parity where the chunk includes N of said parity packets, where N is an integer equal to or greater than 3 and the chunk includes at least 3 and at most (2N1)-N of the information packets.
74. An apparatus as set forth in claim 73, wherein the means for transmitting further includes means for receiving and processing acknowledgments from the data network.
75. An apparatus as set forth in claim 74, wherein the means for transmitting is operative for retransmitting all or a portion of the chunk based on at least one of: the information contained in the acknowledgment, and nonreceipt of the acknowledgment within an allowed amount of time.
76. An apparatus as set forth in claim 72, wherein means for transmitting further includes means for changing the redtype of the chunks and transmission packets to be transmitted.
77. An apparatus as set forth in claim 70, wherein the means for transmitting is operative for changing the number of the transmission chunks within the superchunk.
78. An apparatus as set forth in claim 76, wherein the redtype is changed dynamically based on at least one of: the information in the acknowledgments received from the chunks previously transmitted and nonreceipt of the acknowledgment within an allowed time.
79. An apparatus as set forth in claim 77, wherein the number of chunks in a superchunk is changed dynamically based on at least one of: information in acknowledgments received from the chunks previously transmitted and nonreceipt of an acknowledgment within an allowed time.
80. An apparatus for regenerating at least one information packet transmitted over a data network, comprising:
means for receiving a plurality of information packets and at least one parity packet (collectively transmission packets), said parity packet having a content based on said information packets;
means for detecting any problems which may exist relative to any of said plurality of information packets which were originally transmitted, said problems including one of packet loss and packet damage; and
means for regenerating at least one of said plurality of information packets using said at least one parity packet, wherein the regeneration of said information packets is based on the detection of problems relative to said plurality of information packets.
81. An apparatus as set forth in claim 80, wherein said means for detecting comprises means for analyzing check parameters associated with said information packets to identify said problems.
82. An apparatus as set forth in claim 80, wherein the means for detecting includes means for determining whether any of said plurality of information and parity packets has not been received within an allowed time.
83. An apparatus as set forth in claim 80, wherein the received transmission packets comprise up to 2N1 packets including N parity packets and said means for regenerating comprises processing means for processing said up to 2N1 packets to obtain up to (2N1)-N information packets.
84. An apparatus as set forth in claim 80, further including means for transmitting an acknowledgment upon receipt of a portion of the plurality of information packets, where the acknowledgment contains information that includes retransmission requirements for information packets previously transmitted.
85. An apparatus as set forth in claim 80 wherein the means for regenerating comprises means for performing an XOR operation between corresponding bits in a payload portion of the information and parity packets received from the data network.
86. An apparatus for use in configuring network node equipment to transmit parity packets in addition to information packets, comprising:
storage means configured to store logic for receiving a data stream, dividing said stream into information packets and generating parity packets having a content based on said information packets, wherein said parity packets can be used at a receiving node to regenerate information packets lost during a network transmission; and
downloading means for use in downloading said logic to said network node equipment.
87. An apparatus as set forth in claim 86, wherein said storage means is configured to store logic for dividing at least a portion said data stream into N packets and generating one parity packet having a content based on said N packets.
88. An apparatus as set forth in claim 86, wherein said storage means is configured to store logic for dividing said data stream into up to 2N1 information packets and generate N parity packets based on said information packets, where N is an integer of at least 3.
89. An apparatus as set forth in claim 86, wherein said downloading means comprises a communications port for use in receiving and transmitting data in a network.
90. An apparatus for use in configuring network node equipment to regenerate data packets lost in a network transmission, comprising:
storage means configured to store logic for receiving a stream of information packets and parity packets where the parity packets have a content based on said information packets, for identifying a lost information packet and for using at least one of said parity packets to regenerate said lost information packet and
downloading means for use in downloading said logic to said network node equipment.
91. An apparatus as set forth in claim 90, wherein said downloading means comprises a communications port for use in receiving and transmitting data in a network.
92. A method for constructing a system for transmitting information over a data network comprising:
identifying a transmitting node on the data network, wherein the transmitting node includes a first processing means which receives a data stream containing the information to be transmitted;
providing to the first processing means:
means for dividing a the data stream into a plurality of information packets;
means for generating at least one parity packet with a content generated from a selected number of said plurality of information packets, and including the at least one parity packet with the plurality of information packets; and
means for transmitting the plurality of information packets and the at least one parity packet over the data network;

identifying a receiving node on the data network, wherein the receiving node includes a second processing means which reconstructs the information transmitted over the network into the data stream; and
providing to the second processing means:
means for detecting arrival of a plurality of the information packets, at least one parity packet with a content generated from a selected number of said information packets, and any problems which may exist relative to any of said plurality of information packets which were originally transmitted; and
means for regenerating at least one of said plurality of information packets using a combination of said at least one parity packet, wherein the regeneration of said information transmission packets is based on the detection of problems relative to said plurality of information packets.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A gaming system comprising:
at least one display device;
at least one input device;
at least one processor; and
at least one memory device that stores a plurality of instructions which, when executed by the at least one processor, cause the at least one processor to operate with the at least one display device and the at least one input device to:
(a) display a game including a plurality of different multi-component symbols, wherein, for each of a plurality of the multi-component symbols, said multi-component symbol includes one or more of a plurality of different symbol components; and
(b) for a play of the game:
(i) randomly generate and display a plurality of the multi-component symbols at a plurality of symbol display areas; and
(ii) for a set of at least two of the displayed multi-component symbols:
(A) for a first one of the displayed multi-component symbols of said set, determine a quantity of symbol components in said first displayed mufti-component symbol that are also included in each other displayed multi-component symbol of said set;
(B) determine any award based on said determined quantity; and
(C) display any determined award.
2. The gaming system of claim 1, wherein the plurality of instructions, when executed by the at least one processor, cause the at least one processor to repeat (ii)(A) to (ii)(C) for a second set of at least two of the displayed multi-component symbols.
3. The gaming system of claim 2, wherein the set and the second set include different displayed multi-component symbols.
4. The gaming system of claim 1, wherein a first determined award when the quantity is a first quantity is different than a second determined award when the quantity is a second different quantity.
5. The gaming system of claim 4, wherein the second quantity is greater than the first quantity and the second determined award is greater than the first determined award.
6. The gaming system of claim 1, wherein:
(a) for each multi-component symbol, said multi-component symbol includes one or more symbol component locations and any symbol components of said multi-component symbol are displayed at said one or more symbol component locations; and
(b) the plurality of instructions, when executed by the at least one processor, cause the at least one processor to determine any award based on said determined quantity and not based on the symbol component locations at which any symbol components of the multi-component symbols of the set are displayed.
7. A method of operating a gaming system, said method comprising:
(a) causing at least one processor to execute a plurality of instructions to operate with at least one display device to display a game including a plurality of different multi-component symbols, wherein, for each of a plurality of the multi-component symbols, said multi-component symbol includes one or more of a plurality of different symbol components; and
(b) for a play of the game:
(i) causing the at least one processor to execute the plurality of instructions to randomly generate and operate with the at least one display device to display a plurality of the multi-component symbols at a plurality of symbol display areas; and
(ii) for a set of at least two of the displayed multi-component symbols:
(A) for a first one of the displayed multi-component symbols of said set, causing the at least one processor to execute the plurality of instructions to determine a quantity of symbol components in said first displayed multi-component symbol that are also included in each other displayed multi-component symbol of said set;
(B) causing the at least one processor to execute the plurality of instructions to determine any award based on said determined quantity; and
(C) causing the at least one processor to execute the plurality of instructions to operate with the at least one display device to display any determined award.
8. The method of claim 7, which includes repeating (ii)(A) to (ii)(C) for a second set of at least two of the displayed multi-component symbols.
9. The method of claim 8, wherein the set and the second set include different displayed multi-component symbols.
10. The method of claim 7, wherein a first determined award when the quantity is a first quantity is different than a second determined award when the quantity is a second different quantity.
11. The method of claim 10, wherein the second quantity is greater than the first quantity and the second determined award is greater than the first determined award.
12. The method of claim 7:
(a) wherein for each multi-component symbol, said multi-component symbol includes one or more symbol component locations and any symbol components of said multi-component symbol are displayed at said one or more symbol component locations; and
(b) which includes causing the at least one processor to execute the plurality of instructions to determine any award based on said determined quantity and not based on the symbol component locations at which any symbol components of the multi-component symbols of the set are displayed.
13. The method of claim 7, which is provided through a data network.
14. The method of claim 13, wherein the data network is an internet.
15. A non-transitory computer readable medium that stores a plurality of instructions which, when executed by at least one processor, cause the at least one processor to:
(a) cause at least one display device to display a game including a plurality of different multi-component symbols, wherein, for each of a plurality of the multi-component symbols, said multi-component symbol includes one or more of a plurality of different symbol components; and
(b) for a play of the game:
(i) randomly generate and cause the at least one display device to display a plurality of the multi-component symbols at a plurality of symbol display areas; and
(ii) for a set of at least two of the displayed multi-component symbols:
(A) for a first one of the displayed multi-component symbols of said set, determine a quantity of symbol components in said first displayed multi-component symbol that are also included in each other displayed multi-component symbol of said set;
(B) determine any award based on said determined quantity; and
(C) cause the at least one display device to display any determined award.
16. The non-transitory computer readable medium of claim 15, wherein the plurality of instructions, when executed by the at least one processor, cause the at least one processor to repeat (ii)(A) to (ii)(C) for a second set of at least two of the displayed multi-component symbols.
17. The non-transitory computer readable medium of claim 16, wherein the set and the second set include different displayed multi-component symbols.
18. The non-transitory computer readable medium of claim 15, wherein a first determined award when the quantity is a first quantity is different than a second determined award when the quantity is a second different quantity.
19. The non-transitory computer readable medium of claim 18, wherein the second quantity is greater than the first quantity and the second determined award is greater than the first determined award.
20. The non-transitory computer readable medium of claim 15, wherein:
(a) for each multi-component symbol, said multi-component symbol includes one or more symbol component locations and any symbol components of said multi-component symbol are displayed at said one or more symbol component locations; and
(b) the plurality of instructions, when executed by the at least one processor, cause the at least one processor to determine any award based on said determined quantity and not based on the symbol component locations at which any symbol components of the multi-component symbols of the set are displayed.